Sciweavers

2109 search results - page 62 / 422
» Solving Necklace Constraint Problems
Sort
View
163
Voted
FLAIRS
2008
15 years 6 months ago
Reformulating Constraint Models for Classical Planning
Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint s...
Roman Barták, Daniel Toropila
EAAI
2008
104views more  EAAI 2008»
15 years 4 months ago
Feasible distributed CSP models for scheduling problems
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
Miguel A. Salido, Adriana Giret
113
Voted
CPAIOR
2009
Springer
15 years 11 months ago
Open Constraints in a Boundable World
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint pro...
Michael J. Maher
ISSRE
2007
IEEE
15 years 6 months ago
Improving Constraint-Based Testing with Dynamic Linear Relaxations
Constraint-Based Testing (CBT) is the process of generating test cases against a testing objective by using constraint solving techniques. In CBT, testing objectives are given und...
Tristan Denmat, Arnaud Gotlieb, Mireille Ducass&ea...
AAAI
2006
15 years 6 months ago
An Iterative Algorithm for Solving Constrained Decentralized Markov Decision Processes
Despite the significant progress to extend Markov Decision Processes (MDP) to cooperative multi-agent systems, developing approaches that can deal with realistic problems remains ...
Aurélie Beynier, Abdel-Illah Mouaddib