Sciweavers

1483 search results - page 32 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
CP
2005
Springer
14 years 27 days ago
Evolving Variable-Ordering Heuristics for Constrained Optimisation
In this paper we present and evaluate an evolutionary approach for learning new constraint satisfaction algorithms, specifically for MAX-SAT optimisation problems. Our approach of...
Stuart Bain, John Thornton, Abdul Sattar
SBACPAD
2003
IEEE
125views Hardware» more  SBACPAD 2003»
14 years 4 months ago
Applying Scheduling by Edge Reversal to Constraint Partitioning
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
Marluce Rodrigues Pereira, Patrícia Kayser ...
ATAL
2010
Springer
14 years 2 days ago
A general, fully distributed multi-agent planning algorithm
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
Raz Nissim, Ronen I. Brafman, Carmel Domshlak
IAT
2003
IEEE
14 years 4 months ago
Problem-solving in open environments
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
Santiago Macho-Gonzalez, Boi Faltings
RSS
2007
134views Robotics» more  RSS 2007»
14 years 11 days ago
A Discrete Geometric Optimal Control Framework for Systems with Symmetries
— This paper studies the optimal motion control of mechanical systems through a discrete geometric approach. At the core of our formulation is a discrete Lagrange-d’AlembertPon...
Marin Kobilarov, Mathieu Desbrun, Jerrold E. Marsd...