Sciweavers

405 search results - page 2 / 81
» On the Complexity of Global Constraint Satisfaction
Sort
View
ASE
1998
81views more  ASE 1998»
13 years 5 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang
CACM
2010
94views more  CACM 2010»
13 years 5 months ago
Constraint satisfaction problems and global cardinality constraints
Andrei A. Bulatov, Dániel Marx
PUK
2001
13 years 6 months ago
Realizing a Global Hyperpolyhedron Constraint via LP Techniques
Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...
Miguel A. Salido, Adriana Giret, Federico Barber
FLAIRS
2007
13 years 7 months ago
Learning to Identify Global Bottlenecks in Constraint Satisfaction Search
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
Diarmuid Grimes, Richard J. Wallace