Sciweavers

4083 search results - page 644 / 817
» The EvA2 Optimization Framework
Sort
View
UAI
1998
15 years 8 months ago
Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
Ronald Parr
PUK
2000
15 years 8 months ago
Dynamic Scheduling of Progressive Processing Plans
Progressive processing plans allow systems to tradeoff computational resources against the quality of service by specifying alternative ways in which to accomplish each step. When ...
Shlomo Zilberstein, Abdel-Illah Mouaddib, Andrew A...
AIPS
2009
15 years 7 months ago
Suboptimal and Anytime Heuristic Search on Multi-Core Machines
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
Ethan Burns, Seth Lemons, Wheeler Ruml, Rong Zhou
COR
2008
128views more  COR 2008»
15 years 6 months ago
Solving dynamic stochastic economic models by mathematical programming decomposition methods
Discrete-time optimal control problems arise naturally in many economic problems. Despite the rapid growth in computing power and new developments in the literature, many economic...
Mercedes Esteban-Bravo, Francisco J. Nogales
ENTCS
2006
126views more  ENTCS 2006»
15 years 6 months ago
An Applicative Control-Flow Graph Based on Huet's Zipper
We are using ML to build a compiler that does low-level optimization. To support optimizations in classic imperative style, we built a control-flow graph using mutable pointers an...
Norman Ramsey, João Dias