1689 search results - page 91 / 338 » Proximate point searching |
82
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...
126
click to vote
HEURISTICS
1998
15 years 13 days ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
109
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
This paper proposes a method to use reference points as preferences to guide a particle swarm algorithm to search towards preferred regions of the Pareto front. A decision maker c...
111
Voted
GCB
2009
Springer
15 years 7 months ago
2009
Springer
: Genome annotation relies to a large extent on the recognition of homologs to already known genes. The starting point for such protocols is a collection of known sequences from on...
76
Voted
ESA
2003
Springer
15 years 6 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...