Sciweavers

314 search results - page 29 / 63
» A non-binary constraint ordering heuristic for constraint sa...
Sort
View
AAAI
1994
13 years 9 months ago
Dead-End Driven Learning
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...
Daniel Frost, Rina Dechter
CP
2003
Springer
14 years 28 days ago
Open Constraint Optimization
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
Boi Faltings, Santiago Macho-Gonzalez
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
13 years 6 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...
SSD
2007
Springer
116views Database» more  SSD 2007»
14 years 1 months ago
Continuous Constraint Query Evaluation for Spatiotemporal Streams
In this paper we study the evaluation of continuous constraint queries (CCQs) for spatiotemporal streams. A CCQ triggers an alert whenever a configuration of constraints between s...
Marios Hadjieleftheriou, Nikos Mamoulis, Yufei Tao
EJC
2010
13 years 7 months ago
Dualities in full homomorphisms
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...
Richard N. Ball, Jaroslav Nesetril, Ales Pultr