805 search results - page 43 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
STACS
2005
Springer
14 years 4 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...
CP
2009
Springer
14 years 5 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...
GMP
2006
IEEE
14 years 4 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...
AAAI
2007
14 years 1 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 ...
AAAI
1994
14 years 5 days 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 ...