Sciweavers

1690 search results - page 204 / 338
» Algorithmic Properties of Millstream Systems
Sort
View
AUTOMATICA
2007
65views more  AUTOMATICA 2007»
15 years 5 months ago
Passivity-based designs for synchronized path-following
— We consider a formation control system where individual systems are controlled by a path-following design and the path variables are to be synchronized. We first show a passiv...
Ivar-André F. Ihle, Murat Arcak, Thor I. Fo...
GVD
2003
151views Database» more  GVD 2003»
15 years 6 months ago
Bridging the GAP Between Relational and Native XML Storage with Staircase Join
Several mapping schemes have recently been proposed to store XML data in relational tables. Relational database systems are readily available and can handle vast amounts of data v...
Jens Teubner, Torsten Grust, Maurice van Keulen
131
Voted
APLAS
2007
ACM
15 years 9 months ago
Polymorphic Delimited Continuations
Abstract. This paper presents a polymorphic type system for a language with delimited control operators, shift and reset. Based on the monomorphic type system by Danvy and Filinski...
Kenichi Asai, Yukiyoshi Kameyama
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
16 years 5 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
ICDCS
1996
IEEE
15 years 9 months ago
How to Recover Efficiently and Asynchronously when Optimism Fails
We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts - a fault-tolerant vector clock t...
Om P. Damani, Vijay K. Garg