566 search results - page 20 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
COLING
2000
15 years 1 months ago
2000
A method is de.scribed by which a rhetoricalstructure tree can be realized by a text structure made up of sections, paragraphs, sentences, vertical lists, mid other textual patter...
109
Voted
CP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
84
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal i...
133
Voted
ICSOC
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Web portals provide an efficient gateway to a broad range of Eservices, resources and information. Web portals need to evolve towards being adaptive in nature, so that th...
ESA
2006
Springer
15 years 4 months ago
2006
Springer
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...