Sciweavers

658 search results - page 41 / 132
» Partially Ordered Constraint Optimization Problems
Sort
View
AAAI
1997
15 years 2 months ago
Effective Redundant Constraints for Online Scheduling
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
Lise Getoor, Greger Ottosson, Markus P. J. Fromher...
PPDP
2005
Springer
15 years 6 months ago
Heuristics, optimizations, and parallelism for protein structure prediction in CLP(FD)
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
Alessandro Dal Palù, Agostino Dovier, Enric...
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
14 years 12 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...
PAAMS
2010
Springer
15 years 6 months ago
An UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
Damien Pellier, Bruno Bouzy, Marc Métivier
ICIP
2009
IEEE
14 years 11 months ago
Total variation projection with first order schemes
This article proposes a new algorithm to compute the projection on the set of images whose total variation is bounded by a constant. The projection is computed through a dual form...
Mohamed-Jalal Fadili, Gabriel Peyré