5316 search results - page 71 / 1064 » Which Search Problems Are Random |
122
Voted
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
111
Voted
SIGIR
2006
ACM
15 years 6 months ago
2006
ACM
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
114
Voted
COMPGEOM
2008
ACM
15 years 2 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
92
Voted
AAAI
1997
15 years 2 months ago
1997
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
100
click to vote
EOR
2002
15 years 19 days ago
2002
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...