2398 search results - page 173 / 480 » Constraint Programming and Graph Algorithms |
151
click to vote
AAAI
2007
15 years 8 months ago
2007
Several distributed constraint reasoning algorithms employ Depth First Search (DFS) trees on the constraint graph that spans involved agents. In this article we show that it is po...
163
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Protein structure analysis and comparison are major challenges in structural bioinformatics. Despite the existence of many tools and algorithms, very few of them have ...
191
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
176
click to vote
IJCAI
2003
15 years 7 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
166
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...