Sciweavers

1264 search results - page 37 / 253
» The framework approach for constraint satisfaction
Sort
View
JAIR
2010
145views more  JAIR 2010»
15 years 4 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
IAT
2008
IEEE
16 years 16 days ago
Competency-Based Intelligent Curriculum Sequencing: Comparing Two Evolutionary Approaches
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Although semiautomatic to...
Luis de Marcos, Roberto Barchino, José-Javi...
SAT
2004
Springer
101views Hardware» more  SAT 2004»
15 years 11 months ago
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
Michael Bauland, Philippe Chapdelaine, Nadia Creig...
142
Voted
CP
2008
Springer
15 years 7 months ago
Guiding Search in QCSP+ with Back-Propagation
The Quantified Constraint Satisfaction Problem (QCSP) has been introduced to express situations in which we are not able to control the value of some of the variables (the universa...
Guillaume Verger, Christian Bessiere
ACISICIS
2008
IEEE
16 years 17 days ago
An Integer Linear Programming Approach for Dedicated Machine Constraint
Dedicated machine constraint is one of the new challenges introduced in photolithography machinery of the semiconductor manufacturing system due to natural bias. Previous research...
Huy Nguyen Anh Pham, Arthur M. D. Shr, Peter P. Ch...