1197 search results - page 76 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
RAS
2006
13 years 9 months ago
2006
This paper considers trajectory planning problems for autonomous robots in information gathering tasks. The objective of the planning is to maximize the information gathered withi...
CP
2008
Springer
13 years 11 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
ECAI
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
ECCV
2002
Springer
14 years 11 months ago
2002
Springer
Abstract. Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorith...
SSDBM
2003
IEEE
14 years 2 months ago
2003
IEEE
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...