808 search results - page 36 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
WG
2004
Springer
14 years 23 days ago
2004
Springer
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
ICCBR
2003
Springer
14 years 19 days ago
2003
Springer
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
CONSTRAINTS
1998
13 years 7 months ago
1998
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
CDB
2004
Springer
14 years 25 days ago
2004
Springer
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....