Sciweavers

1380 search results - page 200 / 276
» Computing the optimal strategy to commit to
Sort
View
ICRA
2003
IEEE
125views Robotics» more  ICRA 2003»
14 years 1 months ago
Online footstep planning for humanoid robots
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general...
James J. Kuffner Jr., Satoshi Kagami, Koichi Nishi...
COCOS
2003
Springer
139views Optimization» more  COCOS 2003»
14 years 1 months ago
Inter-block Backtracking: Exploiting the Structure in Continuous CSPs
This paper details a technique, called inter-block backtracking (IBB), which improves interval solving of decomposed systems with non-linear equations over the reals. This techniqu...
Bertrand Neveu, Christophe Jermann, Gilles Trombet...
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
13 years 11 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
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...
Martin Gruber, Jano I. van Hemert, Günther R....
GECCO
2006
Springer
218views Optimization» more  GECCO 2006»
13 years 11 months ago
A survey of mutation techniques in genetic programming
The importance of mutation varies across evolutionary computation domains including: genetic programming, evolution strategies, and genetic algorithms. In the genetic programming ...
Alan Piszcz, Terence Soule
GECCO
2006
Springer
127views Optimization» more  GECCO 2006»
13 years 11 months ago
Multiobjective genetic algorithms for multiscaling excited state direct dynamics in photochemistry
This paper studies the effectiveness of multiobjective genetic and evolutionary algorithms in multiscaling excited state direct dynamics in photochemistry via rapid reparameteriza...
Kumara Sastry, D. D. Johnson, Alexis L. Thompson, ...