Sciweavers

71 search results - page 4 / 15
» Partial Order Reduction for Probabilistic Branching Time
Sort
View
AUSAI
2008
Springer
14 years 11 months ago
Partial Order Hierarchical Reinforcement Learning
In this paper the notion of a partial-order plan is extended to task-hierarchies. We introduce the concept of a partial-order taskhierarchy that decomposes a problem using multi-ta...
Bernhard Hengst
ICCAD
2006
IEEE
165views Hardware» more  ICCAD 2006»
15 years 6 months ago
A fast block structure preserving model order reduction for inverse inductance circuits
Most existing RCL−1 circuit reductions stamp inverse inductance L−1 elements by a second-order nodal analysis (NA). The NA formulation uses nodal voltage variables and describ...
Hao Yu, Yiyu Shi, Lei He, David Smart
ICS
1995
Tsinghua U.
15 years 1 months ago
Run-Time Methods for Parallelizing Partially Parallel Loops
In this paper we give a new run–time technique for finding an optimal parallel execution schedule for a partially parallel loop, i.e., a loop whose parallelization requires syn...
Lawrence Rauchwerger, Nancy M. Amato, David A. Pad...
APN
2011
Springer
14 years 1 months ago
On the Origin of Events: Branching Cells as Stubborn Sets
In prime event structures with binary conflicts (pes-bc)3 a branching cell [1] is a subset of events closed under downward causality and immediate conflict relations. This means ...
Henri Hansen, Xu Wang
DAGSTUHL
2006
14 years 11 months ago
Physical 2D Morphware and Power Reduction Methods for Everyone
Dynamic and partial reconfiguration discovers more and more the focus in academic and industrial research. Modern systems in e.g. avionic and automotive applications exploit the p...
Jürgen Becker, Michael Hübner, Katarina ...