5314 search results - page 370 / 1063 » Hybrid Dynamic Programming |
203
click to vote
DATESO
2009
15 years 4 months ago
2009
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
150
click to vote
IOR
2010
15 years 4 months ago
2010
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
214
click to vote
PPOPP
2011
ACM
14 years 9 months ago
2011
ACM
We describe two novel constructs for programming parallel machines with multi-level memory hierarchies: call-up, which allows a child task to invoke computation on its parent, and...
148
click to vote
IAT
2006
IEEE
16 years 22 days ago
2006
IEEE
We present a new approach to distributed problem solving based on high-level program execution. While this technique has proven itself for single-agent systems based on the Golog ...
186
click to vote
SPIN
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among th...