160 search results - page 25 / 32 » Solving Systems of Difference Constraints Incrementally |
111
click to vote
JAIR
2006
14 years 11 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
132
click to vote
ICS
2005
Tsinghua U.
15 years 5 months ago
2005
Tsinghua U.
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
111
click to vote
CPAIOR
2008
Springer
15 years 1 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
DNA
2006
Springer
15 years 3 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
104
click to vote
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— We propose the quality-of-service (QoS) driven power allocation schemes for parallel fading channels when considering imperfect channel estimations. In particular, the parallel...