Sciweavers

35 search results - page 3 / 7
» A Fast and Simple Algorithm for Bounds Consistency of the Al...
Sort
View
JAIR
2011
123views more  JAIR 2011»
13 years 19 days ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...
AIPS
2010
13 years 6 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
LICS
1997
IEEE
13 years 10 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof
CPAIOR
2008
Springer
13 years 7 months ago
Counting Solutions of Knapsack Constraints
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
Gilles Pesant, Claude-Guy Quimper
WDAG
1994
Springer
104views Algorithms» more  WDAG 1994»
13 years 9 months ago
Fast Increment Registers
We give an optimal, wait-free implementation of an increment register. An increment register is a concurrent object consisting of an integer-valued register with an increment oper...
Soma Chaudhuri, Mark R. Tuttle