Sciweavers

942 search results - page 174 / 189
» Distance Constraint Satisfaction Problems
Sort
View
CORR
2006
Springer
125views Education» more  CORR 2006»
13 years 9 months ago
Barriers and local minima in energy landscapes of stochastic local search
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
Petteri Kaski
GECCO
2010
Springer
214views Optimization» more  GECCO 2010»
14 years 1 months ago
Mixed-integer evolution strategy using multiobjective selection applied to warehouse design optimization
This paper reports about the application of a new variant of multiobjective Mixed-Integer Evolution Strategy to a warehouse design optimization problem. The algorithm is able to d...
Edgar Reehuis, Thomas Bäck
COMPGEOM
2008
ACM
13 years 11 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
IJRR
2007
75views more  IJRR 2007»
13 years 9 months ago
Surveillance Strategies for a Pursuer with Finite Sensor Range
This paper addresses the pursuit-evasion problem of maintaining surveillance by a pursuer of an evader in a world populated by polygonal obstacles. This requires the pursuer to pl...
Rafael Murrieta-Cid, Teja Muppirala, Alejandro Sar...
AVSS
2007
IEEE
14 years 4 months ago
Vision based anti-collision system for rail track maintenance vehicles
Maintenance trains travel in convoy. In Australia, only the first train of the convoy pays attention to the track signalization (the other convoy vehicles simply follow the prece...
Frédéric Maire