Sciweavers

261 search results - page 39 / 53
» On Threshold BDDs and the Optimal Variable Ordering Problem
Sort
View
ICTAI
2003
IEEE
14 years 1 months ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
JAIR
2008
98views more  JAIR 2008»
13 years 7 months ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...
CP
2005
Springer
14 years 1 months ago
Search Heuristics and Heavy-Tailed Behaviour
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
Tudor Hulubei, Barry O'Sullivan
CONSTRAINTS
2006
77views more  CONSTRAINTS 2006»
13 years 7 months ago
The Impact of Search Heuristics on Heavy-Tailed Behaviour
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
Tudor Hulubei, Barry O'Sullivan

Book
357views
15 years 5 months ago
Foundations of Constraint Satisfaction
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
Edward Tsang