61 search results - page 2 / 13 » Tree Decomposition with Applications to Constraint Processin... |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
RP
2010
Springer
13 years 5 months ago
2010
Springer
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
EVOW
2010
Springer
13 years 11 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
This work presents generalized low-rank signal decompositions with the aid of switching techniques and adaptive algorithms, which do not require eigen-decompositions, for space-ti...
IJCAI
1993
13 years 8 months ago
1993
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...