Sciweavers

2725 search results - page 222 / 545
» Constraint Solving for Interpolation
Sort
View
CP
2006
Springer
15 years 11 months ago
An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining fi...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
EVOW
2006
Springer
15 years 11 months ago
A Memetic Algorithm with Bucket Elimination for the Still Life Problem
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
José E. Gallardo, Carlos Cotta, Antonio J. ...
AIPS
2003
15 years 8 months ago
Vehicle Routing and Job Shop Scheduling: What's the Difference?
Despite a number of similarities, vehicle routing problems and scheduling problems are typically solved with different techniques. In this paper, we undertake a systematic study o...
J. Christopher Beck, Patrick Prosser, Evgeny Selen...
NIPS
2003
15 years 8 months ago
Learning a Distance Metric from Relative Comparisons
This paper presents a method for learning a distance metric from relative comparison such as “A is closer to B than A is to C”. Taking a Support Vector Machine (SVM) approach,...
Matthew Schultz, Thorsten Joachims
ECAI
2010
Springer
15 years 8 months ago
Restarts and Nogood Recording in Qualitative Constraint-based Reasoning
Abstract. This paper introduces restart and nogood recording techniques in the domain of qualitative spatial and temporal reasoning. Nogoods and restarts can be applied orthogonall...
Matthias Westphal, Stefan Wölfl, Jason Jingsh...