Sciweavers

313 search results - page 6 / 63
» Complete Local Search with Memory
Sort
View
ICTAI
2006
IEEE
14 years 3 months ago
Intelligent Neighborhood Exploration in Local Search Heuristics
Standard tabu search methods are based on the complete exploration of current solution neighborhood. However, for some problems with very large neighborhood or time-consuming eval...
Isabelle Devarenne, Hakim Mabed, Alexandre Caminad...
VLDB
2002
ACM
154views Database» more  VLDB 2002»
13 years 9 months ago
I/O-Conscious Data Preparation for Large-Scale Web Search Engines
Given that commercial search engines cover billions of web pages, efficiently managing the corresponding volumes of disk-resident data needed to answer user queries quickly is a f...
Maxim Lifantsev, Tzi-cker Chiueh
SOCO
2010
Springer
13 years 8 months ago
Evolving the memory of a criminal's face: methods to search a face space more effectively
Witnesses and victims of serious crime are often required to construct a facial composite, a visual likeness of a suspect’s face. The traditional method is for them to select in...
Charlie D. Frowd, Vicki Bruce, Melanie Pitchford, ...
SAT
2004
Springer
95views Hardware» more  SAT 2004»
14 years 3 months ago
Local Search for Very Large SAT Problems
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
Steven David Prestwich, Colin Quirke
SAGA
2001
Springer
14 years 2 months ago
Yet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Philippe Codognet, Daniel Diaz