Sciweavers

4745 search results - page 212 / 949
» Discretization: An Enabling Technique
Sort
View
SAC
2009
ACM
16 years 1 months ago
Origami fold as algebraic graph rewriting
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
Tetsuo Ida, Hidekazu Takahashi
IPPS
2007
IEEE
16 years 25 days ago
Coarse-grain Parallel Execution for 2-dimensional PDE Problems
This paper presents a new approach for the execution of coarse-grain (tiled) parallel SPMD code for applications derived from the explicit discretization of 2-dimensional PDE prob...
Georgios I. Goumas, Nikolaos Drosinos, Vasileios K...
ECML
2007
Springer
16 years 21 days ago
Policy Gradient Critics
We present Policy Gradient Actor-Critic (PGAC), a new model-free Reinforcement Learning (RL) method for creating limited-memory stochastic policies for Partially Observable Markov ...
Daan Wierstra, Jürgen Schmidhuber
TELETRAFFIC
2007
Springer
16 years 19 days ago
A Phase-Type Based Markov Chain Model for IEEE 802.16e Sleep Mode and Its Performance Analysis
Abstract. To support battery powered mobile broadband wireless access devices efficiently, IEEE 802.16e defines a sleep mode operation for conserving the power of mobile terminals...
Zhisheng Niu, Yanfeng Zhu, Vilius Benetis
GLOBECOM
2006
IEEE
16 years 17 days ago
Price-Sensitive Application Adaptation in Deadline-Based Networks
— In deadline-based networks, the delay performance experienced by real-time data transfer largely depends on traffic deadlines and the load level along the data transfer path. ...
Xiao Huan Liu, Yanni Ellen Liu