Sciweavers

5316 search results - page 323 / 1064
» Which Search Problems Are Random
Sort
View
JIS
2008
119views more  JIS 2008»
15 years 6 months ago
A three-year study on the freshness of web search engine databases
This paper deals with one aspect of the index quality of search engines: index freshness. The purpose is to analyse the update strategies of the major Web search engines Google, Y...
Dirk Lewandowski
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
16 years 1 months ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 7 months ago
A Performance Study of GA and LSH in Multiprocessor Job Scheduling
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
S. R. Vijayalakshmi, G. Padmavathi
MOBIHOC
2010
ACM
15 years 5 months ago
Near optimal multi-application allocation in shared sensor networks
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
You Xu, Abusayeed Saifullah, Yixin Chen, Chenyang ...
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
16 years 1 months ago
Differential evolution and non-separability: using selective pressure to focus search
Recent results show that the Differential Evolution algorithm has significant difficulty on functions that are not linearly separable. On such functions, the algorithm must rely...
Andrew M. Sutton, Monte Lunacek, L. Darrell Whitle...