Sciweavers

180 search results - page 30 / 36
» Complexity of Homogeneous Co-Boolean Constraint Satisfaction...
Sort
View
CCIA
2005
Springer
14 years 1 months ago
A Preliminary Study on the Relaxation of Numeric Features in Planning
Modern AI planners use different strategies to simplify the complexity of current planning problems and turn them more affordable. In this paper, we present a new approach that div...
Antonio Garrido, Eva Onaindia, Donato Herná...
BIRTHDAY
2003
Springer
14 years 26 days ago
Comet in Context
Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supplychain management, and resource allocation. They often give...
Laurent Michel, Pascal Van Hentenryck
PODS
2002
ACM
167views Database» more  PODS 2002»
14 years 7 months ago
OLAP Dimension Constraints
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
Carlos A. Hurtado, Alberto O. Mendelzon
IJCAI
2001
13 years 9 months ago
Making AC-3 an Optimal Algorithm
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
Yuanlin Zhang, Roland H. C. Yap
ICLP
2004
Springer
14 years 1 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