10 search results - page 1 / 2 » Backtracking Through Biconnected Components of a Constraint ... |
IJCAI
2001
13 years 6 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
CP
2008
Springer
13 years 6 months ago
2008
Springer
The Cell BE processor provides both scalable computation power and flexibility, and it is already being adopted for many computational intensive applications like aerospace, defens...
CERA
2002
13 years 4 months ago
2002
: Many industries are shifting from mass production to mass customization, which demands quick response to the needs of individual customers with high quality and low costs. The de...