805 search results - page 43 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
106
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
ded abstract of this article is published in the proceedings of STACS’05, LNCS 3404, Springer Verlag. A relational structure is a core, if all its endomorphisms are embeddings. T...
134
click to vote
CP
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we present a hybrid model for the demand acceptance variant of the routing and wavelength assignment problem in directed networks, an important benchmark problem in o...
148
click to vote
GMP
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract. We present an efficient and robust algorithm for computing continuous visibility for two- or three-dimensional shapes whose boundaries are NURBS curves or surfaces by li...
162
click to vote
AAAI
2007
15 years 6 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
107
click to vote
AAAI
1994
15 years 5 months ago
1994
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...