435 search results - page 75 / 87 » Partitioning Search Spaces of a Randomized Search |
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
152
click to vote
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
102
click to vote
WEA
2007
Springer
15 years 5 months ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
104
click to vote
SAC
2006
ACM
15 years 5 months ago
2006
ACM
A fundamental problem in peer-to-peer networks is how to locate appropriate peers efficiently to answer a specific query request. This paper proposes a model in which semantically...
ENC
2005
IEEE
15 years 5 months ago
2005
IEEE
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...