Sciweavers

2626 search results - page 212 / 526
» The complexity of stochastic sequences
Sort
View
ECAL
2007
Springer
16 years 22 days ago
Turing Complete Catalytic Particle Computers
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to c...
Anthony M. L. Liekens, Chrisantha Thomas Fernando
ICANN
2007
Springer
16 years 22 days ago
Solving Deep Memory POMDPs with Recurrent Policy Gradients
Abstract. This paper presents Recurrent Policy Gradients, a modelfree reinforcement learning (RL) method creating limited-memory stochastic policies for partially observable Markov...
Daan Wierstra, Alexander Förster, Jan Peters,...
ICN
2007
Springer
16 years 22 days ago
Heuristic Approach of Optimal Code Allocation in High Speed Downlink Packet Access Networks
— In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete ...
Hussein Al-Zubaidy, Jerome Talim, Ioannis Lambadar...
CCGRID
2005
IEEE
16 years 6 days ago
Analyzing the advance reservation of lightpaths in lambda-grids
The scheme of advance reservations in dynamically provisioned optical networks is novel, and there are no gridbased applications designed to utilize this scheme. We formally defi...
Sumit Naiksatam, Silvia M. Figueira, Stephen A. Ch...
FMCO
2004
Springer
112views Formal Methods» more  FMCO 2004»
15 years 12 months ago
Probabilistic Linda-Based Coordination Languages
Abstract. Coordination languages are intended to simplify the development of complex software systems by separating the coordination aspects of an application from its computation ...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...