Sciweavers

614 search results - page 8 / 123
» Probabilistic Arc Consistency
Sort
View
AI
2008
Springer
14 years 11 months ago
Domain filtering consistencies for non-binary constraints
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
Christian Bessiere, Kostas Stergiou, Toby Walsh
IJCAI
1989
15 years 26 days ago
Domain Dependence in Parallel Constraint Satisfaction
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
Paul R. Cooper, Michael J. Swain
CEC
2010
IEEE
14 years 12 months ago
Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem
— Capacitated arc routing problem (CARP) has attracted much attention due to its generality to many real world problems. Memetic algorithm (MA), among other metaheuristic search ...
Liang Feng, Yew-Soon Ong, Quang Huy Nguyen 0001, A...
MICS
2007
90views more  MICS 2007»
14 years 11 months ago
Approximation by Conic Splines
Abstract. We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance ε is c1ε...
Sunayana Ghosh, Sylvain Petitjean, Gert Vegter
SAC
2005
ACM
15 years 5 months ago
Box-set consistency for interval-based constraint problems
As opposed to finite domain CSPs, arc consistency cannot be enforced, in general, on CSPs over the reals, including very simple instances. In contrast, a stronger property, the s...
Gilles Chabert, Gilles Trombettoni, Bertrand Neveu