Sciweavers

346 search results - page 41 / 70
» Solving quantified constraint satisfaction problems
Sort
View
CP
2008
Springer
14 years 11 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
80
Voted
JAIR
2010
145views more  JAIR 2010»
14 years 8 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
83
Voted
SIGITE
2006
ACM
15 years 3 months ago
Does a virtual networking laboratory result in similar student achievement and satisfaction?
Delivery of content in networking and system administration curricula involves significant hands-on laboratory experience supplementing traditional classroom instruction at the Ro...
Edith A. Lawson, William Stackpole
ICTAI
2002
IEEE
15 years 2 months ago
On Temporal Planning as CSP
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
Amol Dattatraya Mali
CORR
2010
Springer
69views Education» more  CORR 2010»
14 years 9 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang