Learn More
Many search trees are impractical ly large to explore exhaustively. Recently, techniques like l imi ted discrepancy search have been proposed for improving the chance of f inding a goal in a l imi(More)
To model combinatorial decision problems involving uncert ain y and probability, we introduce stochastic constraint programming. S tochastic constraint programs contain both decision variables (which(More)
In a graph with a small world topology nodes are highly clustered yet the path length be tween them is small Such a topology can make search problems very di cult since local deci sions quickly(More)
We perform a comprehensive study of mappings between constraint satisfaction problems (CSPs) and propositional satissability (SAT). We analyse four diierent mappings of SAT problems into CSPs, and(More)