5316 search results - page 30 / 1064 » Which Search Problems Are Random |
106
Voted
SAC
2004
ACM
15 years 6 months ago
2004
ACM
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
ECIR
2004
Springer
15 years 2 months ago
2004
Springer
Content-only retrieval of XML documents deals with the problem of locating the smallest XML elements that satisfy the query. In this paper, we investigate the application of a spec...
169
Voted
TELSYS
2011
14 years 7 months ago
2011
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
104
click to vote
ISSRE
2002
IEEE
15 years 5 months ago
2002
IEEE
Formal analysis of software is a powerful analysis tool, but can be too costly. Random search of formal models can reduce that cost, but is theoretically incomplete. However, rand...
95
Voted
EVOW
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) ...