Sciweavers

405 search results - page 41 / 81
» On the Complexity of Global Constraint Satisfaction
Sort
View
EAAI
2010
119views more  EAAI 2010»
14 years 9 months ago
A heuristic-based framework to solve a complex aircraft sizing problem
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...
Céline Badufle, Christophe Blondel, Thierry...
IEEEARES
2007
IEEE
15 years 5 months ago
CSP-Based Firewall Rule Set Diagnosis using Security Policies
The most important part of a firewall configuration process is the implementation of a security policy by a security administrator. However, this security policy is not designed b...
Sergio Pozo, Rafael Ceballos, Rafael M. Gasca
108
Voted
FOCS
1998
IEEE
15 years 3 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
ICLP
2004
Springer
15 years 4 months ago
Non-viability Deductions in Arc-Consistency Computation
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
Camilo Rueda, Frank D. Valencia
IAT
2008
IEEE
15 years 5 months 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...