A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Filters
On the domination search number
2003
Discrete Applied Mathematics
Preserved Fulltext
Various results concerning the domination search number of a graph are presented. ...
We introduce the domination search game which can be seen as a natural modification of the well-known node search game. ...
1 Notice that the domination search number of a disconnected graph G is equal to the maximum domination search number taken over all components of G. ...
doi:10.1016/s0166-218x(02)00389-x
fatcat:r7swtk3tkzcejkfh63p64oa4he
On the Domination Search Number
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Various results concerning the domination search number of a graph are presented. ...
We introduce the domination search game which can be seen as a natural modi cation of the well-known node search game. ...
The domination search number of a disconnected graph G is equal to the maximum domination search number taken over all components of G. ...
doi:10.1007/3-540-40064-8_16
fatcat:7d6ljiislraqbnmq75pjxefhhu
A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We identify the mean growth of the independence number of random binary search trees and random recursive trees and show normal fluctuations around their means. ...
Similarly we also show normal limit laws for the domination number and variations of it for these two cases of random tree models. ...
The authors thank the participants, in particular Luc Devroye and Remco van der Hofstad, for helpful discussions on the present problem. ...
arXiv:1909.12767v2
fatcat:w267di6xgrcvzdti7omjijdrwm
Generalization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Ordinary two replacement rules based on the dominance relation are usually employed in a local search (LS) for multiobjective optimization. ...
In this paper, we generalize the replacement rules based on the dominance relation in multiobjective optimization. ...
We generalize the replacement rules based on the dominance relation by counting the number of better objective values. ...
doi:10.1007/3-540-45105-6_130
fatcat:2iq6aneybfhypgyleastthv6nu
'Dominating-set-based' searching in peer-to-peer networks
2005
International Journal of High Performance Computing and Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
This approach is based on random walk. However, the searching space is restricted to dominating nodes. Simulation has been done and results are compared with the one using regular random walk. ...
In this paper, we propose a dominating-set-based peer-to-peer searching algorithm to maximize the return of searching results while keeping a low cost for both searching and creating/maintaining the connecteddominating-set ...
We used 20 hops as the maximum number for both searching methods. In Table II number of hops using) dominating-set-based searching. ...
doi:10.1504/ijhpcn.2005.008562
fatcat:cugsf7tblvetrexd6pdb3ok2je
Dominating-Set-Based Searching in Peer-to-Peer Networks
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
This approach is based on random walk. However, the searching space is restricted to dominating nodes. Simulation has been done and results are compared with the one using regular random walk. ...
In this paper, we propose a dominating-set-based peer-to-peer searching algorithm to maximize the return of searching results while keeping a low cost for both searching and creating/maintaining the connecteddominating-set ...
We used 20 hops as the maximum number for both searching methods. In Table II number of hops using) dominating-set-based searching. ...
doi:10.1007/978-3-540-24679-4_67
fatcat:pd2bg6zb4jfp3kel62ogv2y3ue
Web-page Indexing based on the Prioritize Ontology Terms
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The proposed Webpage indexing mechanism has applied on domain specific Webpages and we have identified the Webpage domain based on an Ontology. ...
The Webpage indexing mechanism of a search engine plays a big role to retrieve Web search results in a faster way from the huge volume of Web resources. ...
After providing all the inputs, i.e., search tokens, relevance range and number of search results, Web searcher need to click on "Search" button to get the search results. ...
arXiv:1311.6243v1
fatcat:v27ozezxqfbtlgalbt7uejsjjy
Distance d-Domination Games
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. ...
On the positive side, we establish tractability results for graph classes of bounded degree. ...
on the subject. ...
doi:10.1007/978-3-642-11409-0_27
fatcat:2isaifouazdk7ljxrenimnl3ti
Improved Solution to the Non-Domination Level Update Problem
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In case of insertion, the tree based approach always checks for same number of fronts unlike linear approach in which the number of fronts to be checked depends on the inserted solution. ...
Generally the solution to this problem requires to perform the complete non-dominated sorting which is too expensive in terms of number of comparisons. ...
In place of Algorithm 5 which is based on Left Dominance Binary Search Tree, Algorithm 6 can also be used which is based on Right Dominance Binary Search Tree. ...
arXiv:1510.04796v1
fatcat:fprwuvyxw5fdjibc73cgh2m3di
Link enhancement using constrained range and reduced candidate set searches: a revision
1995
Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Two major improvements are proposed: first, by combining information on the cost and performance of candidate links, we obtain the exact number of links in one step without compromising optimality and ...
Moreover, we use the concept of variable dominance to reduce the number of candidate links without loss of optimality. ...
When we use the reduced candidate set to find the optimal solution, we can use information on the dominated sets to generate new constraints in order to make the search procedure more efficient, i.e. if ...
doi:10.1016/0140-3664(95)99817-v
fatcat:drfnstv5z5brzhyb5sqqwihbji
Minimal dominating sets in graph classes: Combinatorial bounds and enumeration
2013
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
And bound the number of leaves in the search tree is exactly what an estimation of execution time does.
What is the maximum number of minimal dominating sets in a graph on n vertices ? ...
If we can bound the number of leaves in the search tree, we bound at the same time the number of solutions of the problem ! ...
doi:10.1016/j.tcs.2013.03.026
fatcat:ivmx7hhl4fh6xf6ew6cdjis5ya
The Effect of Social Hierarchy on Captive Coyote (Canis latrans) Foraging Behavior
2013
Ethology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
That is, subordinates approached the correct area, but searched more feeders before finding the correct one. ...
To examine the impact of social hierarchy on foraging behavior, we tested 16 captive coyotes in eight naturally established dominant-subordinate pairs, using the guesser-knower paradigm. ...
We gratefully acknowledge the financial and technical support provided by the USDA, Wildlife Service's National Wildlife Research Center. ...
doi:10.1111/eth.12070
fatcat:2gwmuigdtbbgtnuzmcbw462dey
An Efficient Approach to Nondominated Sorting for Evolutionary Multiobjective Optimization
2015
IEEE Transactions on Evolutionary Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Based on this new approach, two non-dominated sorting algorithms have been suggested. ...
This technique, however, can be computationally expensive, especially when the number of individuals in the population becomes large. ...
Two non-dominated sorting algorithms based on the ENS approach have been implemented, one using the sequential search strategy and the other using the binary search strategy to locate the front to which ...
doi:10.1109/tevc.2014.2308305
fatcat:hviavapxcncfzceayxofjcx6be
A tree-search algorithm for ML decoding in underdetermined MIMO systems
2009
2009 6th International Symposium on Wireless Communication Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Also a two-stage tree-search algorithm is presented based on the idea that the ML solution is in the set of equilibrium points of a Hopfield Neural Networks (HNN). ...
In this paper we propose a tree-search algorithm that provides the exact ML solution with lower computational complexity than that required by an exhaustive search of minimum distance. ...
The algorithms are based on the dominance condition and on the HNN equilibrium condition, that provide simple conditions for a reduction of the number of points for which compute the euclidean distance ...
doi:10.1109/iswcs.2009.5285309
fatcat:bilu6fwf55ellmjeasd3i7ekdi
Heuristics for k-domination models of facility location problems in street networks
2021
Computers & Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2021 pre-print arXiv:2111.07885v1 fatcat:of6ekc5syvf67ozhrmesmdd4ny
For the classic minimum dominating set (1-domination) problem, all except one methods perform similarly, which is due to their equivalence in this particular case. ...
We present new greedy and beam search heuristic methods to find small-size k-dominating sets in graphs. ...
The authors evaluated this method against a randomized local search method and the standard greedy search heuristic [15] on a number of real-world graphs. ...
doi:10.1016/j.cor.2021.105368
fatcat:tsgyfqek65df3mwdzvz2qgnt2m
« Previous
Showing results 1 — 15 out of 1,320,927 results