1026 search results - page 28 / 206 » An Optimal Solution to Room Search Problem |
EVOW
2010
Springer
15 years 6 months ago
2010
Springer
We describe and evaluate a multi-objective optimisation (MOO) algorithm that works within the Probability Collectives (PC) optimisation framework. PC is an alternative approach to ...
ANTSW
2008
Springer
15 years 27 days ago
2008
Springer
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...
STOC
2006
ACM
16 years 2 days ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
EVOW
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
108
click to vote
CPAIOR
2008
Springer
15 years 1 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...