5316 search results - page 100 / 1064 » Which Search Problems Are Random |
129
Voted
CVPR
1998
IEEE
16 years 5 months ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
113
Voted
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the cla...
134
click to vote
ESA
1997
Springer
15 years 7 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
128
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— In this paper we consider the problem of query and search in a network, e.g., searching for a specific node or a piece of data. We limit our attention to the class of TTL (tim...
126
click to vote
WIOPT
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flo...