Results 1  10
of
312
Asynchronous stochastic approximation and Qlearning
 Machine Learning
, 1994
"... Abstract £ We provide some general results on the convergence of a class of stochastic approximation algorithms and their parallel and asynchronous variants. We then use these results to study the Qlearning algorithm, areinforcement learning method for solving Markov decision problems, and establi ..."
Abstract

Cited by 204 (4 self)
 Add to MetaCart
Abstract £ We provide some general results on the convergence of a class of stochastic approximation algorithms and their parallel and asynchronous variants. We then use these results to study the Qlearning algorithm, areinforcement learning method for solving Markov decision problems
A Calculus of Mobile Agents
, 1996
"... . We introduce a calculus for mobile agents and give its chemical semantics, with a precise definition for migration, failure, and failure detection. Various examples written in our calculus illustrate how to express remote executions, dynamic loading of remote resources and protocols with mobile ag ..."
Abstract

Cited by 281 (13 self)
 Add to MetaCart
physical sites. If we do not locate channels, we quickly face a global consensus problem for nearly every communication which uses the interconnection network. In a previous work [6], we introduced the joincalculus, an asynchronous variant of Milner's ßcalculus with better locality and better static
Mixed Pfair/ERfair Scheduling of Asynchronous Periodic Tasks
, 2001
"... Pfair Scheduling was proposed by... In this paper, we introduce a workconserving variant of Pfair scheduling called "earlyrelease" fair (ERfair) scheduling. We also present a new scheduling algorithm called PD² and show that it is optimal for scheduling any mix of earlyrelease ..."
Abstract

Cited by 113 (46 self)
 Add to MetaCart
Pfair Scheduling was proposed by... In this paper, we introduce a workconserving variant of Pfair scheduling called "earlyrelease" fair (ERfair) scheduling. We also present a new scheduling algorithm called PD² and show that it is optimal for scheduling any mix of early
Asynchronous Cloth Simulation
"... Abstract This paper presents a new method for cloth simulation, which uses asynchronous variants of both time integration and collision handling. Implicit integration methods like backward Euler and BDF2 are very popular in computer graphics, since they allow for fast and stable animations. However ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract This paper presents a new method for cloth simulation, which uses asynchronous variants of both time integration and collision handling. Implicit integration methods like backward Euler and BDF2 are very popular in computer graphics, since they allow for fast and stable animations
Taming Heterogeneity  The Ptolemy Approach
, 2003
"... Modern embedded computing systems tend to be heterogeneous in the sense of being composed of subsystems with very different characteristics, which communicate and interact in a variety of wayssynchronous or asynchronous, buffered or unbuffered, etc. Obviously, when designing such systems, a mode ..."
Abstract

Cited by 208 (17 self)
 Add to MetaCart
Modern embedded computing systems tend to be heterogeneous in the sense of being composed of subsystems with very different characteristics, which communicate and interact in a variety of wayssynchronous or asynchronous, buffered or unbuffered, etc. Obviously, when designing such systems, a
On asynchronous NewtonSchulz type methods
, 1995
"... The disadvantage of most known asynchronous iteration methods for linear and nonlinear equations seems to be, that the system to be solved, has to be related to an Msystem. In this paper we will introduce an asynchronous method for nonlinear equations F (x) = 0 , which is locally convergent, indepe ..."
Abstract
 Add to MetaCart
, independent of the structures of the Jacobian of F : Admittedly, it seems easy to develop asynchronous variants of Newton's method, which converge even superlinearly, but the trouble of Newton's method cannot be avoided by asynchronous iterations, it is to solve again and again linear systems, which
On Bisimulations for the Asynchronous πcalculus
, 1996
"... The asynchronous picalculus is a variant of the picalculus where message emission is nonblocking. Honda and Tokoro have studied a semantics for this calculus based on bisimulation. Their bisimulation relies on a modified transition system where, at any moment, a process can perform any input acti ..."
Abstract

Cited by 57 (1 self)
 Add to MetaCart
The asynchronous picalculus is a variant of the picalculus where message emission is nonblocking. Honda and Tokoro have studied a semantics for this calculus based on bisimulation. Their bisimulation relies on a modified transition system where, at any moment, a process can perform any input
The QueueRead QueueWrite Asynchronous PRAM Model
 EuroPar'96 Parallel Processing, Lecture Notes in Computer Science
, 1998
"... This paper presents results for the queueread, queuewrite asynchronous parallel random access machine (qrqw asynchronous pram) model, which is the asynchronous variant of the qrqw pram model. The qrqw pram family of models, which was introduced earlier by the authors, permit concurrent reading ..."
Abstract

Cited by 27 (8 self)
 Add to MetaCart
This paper presents results for the queueread, queuewrite asynchronous parallel random access machine (qrqw asynchronous pram) model, which is the asynchronous variant of the qrqw pram model. The qrqw pram family of models, which was introduced earlier by the authors, permit concurrent reading
Convergence of the MinSum Algorithm for Convex Optimization,” preprint
, 2007
"... We establish that the minsum messagepassing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems. 1 ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We establish that the minsum messagepassing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems. 1
Convergence of MinSum MessagePassing for Convex Optimization
, 2007
"... We establish that the minsum messagepassing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems. 1. ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We establish that the minsum messagepassing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems. 1.
Results 1  10
of
312