14165 search results - page 663 / 2833 » The generalized two-server problem |
171
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
We present a simple ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population compute...
173
click to vote
COCO
2007
Springer
16 years 1 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
180
click to vote
CPM
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
197
click to vote
CPM
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
208
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
In this paper, we utilize a predator-prey model in order to identify characteristics of single-objective variation operators in the multi-objective problem domain. In detail, we a...