1197 search results - page 188 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
MP
2010
13 years 6 months ago
2010
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
PRL
2006
13 years 8 months ago
2006
This paper considers the problem of designing an active observer to plan a sequence of decisions regarding what target to look at, through a foveal-sensing action. We propose a fr...
ICPR
2000
IEEE
14 years 9 months ago
2000
IEEE
We present a very simple and effective method for eliminating the degeneracy inherent in a planar scene, and demonstrate its performance in a useful application -- that of binocul...
ENTCS
2007
13 years 8 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
PAMI
2006
13 years 8 months ago
2006
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....