Sciweavers

4198 search results - page 87 / 840
» In search of lost time
Sort
View
ILP
2004
Springer
15 years 11 months ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
16 years 3 days ago
A memetic algorithm for the low autocorrelation binary sequence problem
Finding binary sequences with low autocorrelation is a very hard problem with many practical applications. In this paper we analyze several metaheuristic approaches to tackle the ...
José E. Gallardo, Carlos Cotta, Antonio J. ...
ISSAC
2007
Springer
121views Mathematics» more  ISSAC 2007»
16 years 3 days ago
A comparative analysis of parallel disk-based Methods for enumerating implicit graphs
It is only in the last five years that researchers have begun to use disk-based search techniques on a large scale. The primary examples of its use come from symbolic algebra and...
Eric Robinson, Daniel Kunkle, Gene Cooperman
ISMIR
2005
Springer
129views Music» more  ISMIR 2005»
15 years 11 months ago
Scalable Metadata and Quick Retrieval of Audio Signals
Audio search algorithms have reached a degree of speed and accuracy that allows them to search efficiently within large databases of audio. For speed, algorithms generally depend...
Nancy Bertin, Alain de Cheveigné
AH
2006
Springer
15 years 9 months ago
Personalized Navigation in the Semantic Web
Effective navigation and information retrieval is difficult and time consuming due to the increasing size of hyperspace. The introduction of the semantic web allows us to enhance t...
Michal Tvarozek