2657 search results - page 213 / 532 » On the complexity of hierarchical problem solving |
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...
106
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
126
Voted
CVPR
2011
IEEE
14 years 9 months ago
2011
IEEE
We present a novel probabilistic framework for rigid tracking and segmentation of shapes observed from multiple cameras. Most existing methods have focused on solving each of thes...
116
click to vote
AIPS
2009
15 years 3 months ago
2009
PDDL2.1 supports modelling of complex temporal planning domains in which solutions must exploit concurrency. Few existing temporal planners can solve problems that require concurr...
115
Voted
EOR
2008
15 years 1 months ago
2008
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...