436 search results - page 85 / 88 » Ant algorithms and stigmergy |
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
In this work, we present two new approaches based on variable neighborhood search (VNS) and ant colony optimization (ACO) for the reconstruction of cross cut shredded text documen...
ISRR
2001
Springer
15 years 1 months ago
2001
Springer
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
ICDM
2007
IEEE
15 years 1 months ago
2007
IEEE
Active inference seeks to maximize classification performance while minimizing the amount of data that must be labeled ex ante. This task is particularly relevant in the context o...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
Liveness properties in concurrent systems are, informally, those properties that stipulate that something good eventually happens during execution. In order to prove that a given ...