45 search results - page 4 / 9 » Random Constraint Satisfaction: A More Accurate Picture |
CPC
2006
14 years 9 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
AAAI
1997
14 years 11 months ago
1997
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
PRL
2007
14 years 9 months ago
2007
The bottleneck in interactive visual classification is the exchange of information between human and machine. We introduce the concept of the visible model, which is an ion of an ...
FLAIRS
2008
14 years 12 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
KBSE
1997
IEEE
15 years 1 months ago
1997
IEEE
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...