Sciweavers

5171 search results - page 388 / 1035
» Deterministic Parallel Processing
Sort
View
123
Voted
NC
2007
123views Neural Networks» more  NC 2007»
15 years 3 months ago
The complexity of latching transitions in large scale cortical networks
Abstract. We study latching dynamics, i.e. the ability of a network to hop spontaneously from one discrete attractor state to another, which has been proposed as a model of an inï¬...
Emilio Kropff, Alessandro Treves
166
Voted
ISAAC
2010
Springer
243views Algorithms» more  ISAAC 2010»
15 years 1 months ago
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
Thomas Dueholm Hansen, Uri Zwick
146
Voted
ICMLA
2009
15 years 1 months ago
Multiagent Transfer Learning via Assignment-Based Decomposition
We describe a system that successfully transfers value function knowledge across multiple subdomains of realtime strategy games in the context of multiagent reinforcement learning....
Scott Proper, Prasad Tadepalli
118
Voted
SIAMNUM
2010
140views more  SIAMNUM 2010»
14 years 10 months ago
Finite Element Approximation of the Linear Stochastic Wave Equation with Additive Noise
Semidiscrete finite element approximation of the linear stochastic wave equation with additive noise is studied in a semigroup framework. Optimal error estimates for the determinis...
Mihály Kovács, Stig Larsson, Fardin ...
132
Voted
CORR
2010
Springer
58views Education» more  CORR 2010»
15 years 2 months ago
Realizable Paths and the NL vs L Problem
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
Shiva Kintali