Sciweavers

6756 search results - page 314 / 1352
» Distributed Shared State
Sort
View
ICDCS
1996
IEEE
15 years 10 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
ESOP
2010
Springer
15 years 11 months ago
Dynamic Boundaries: Information Hiding by Second Order Framing with First Order Assertions
Abstract. The hiding of internal invariants creates a mismatch between procedure specifications in an interface and proof obligations on the implementations of those procedures. T...
David A. Naumann, Anindya Banerjee
COLT
1994
Springer
15 years 10 months ago
Efficient Reinforcement Learning
Realistic domains for learning possess regularities that make it possible to generalize experience across related states. This paper explores an environment-modeling framework tha...
Claude-Nicolas Fiechter
IJMMS
1998
114views more  IJMMS 1998»
15 years 6 months ago
The design and evolution of TurboTurtle, a collaborative microworld for exploring Newtonian physics
controls, recoverability, and how strictly views should be shared between students. Teachers can also add structure to the group’s activities by setting the simulation environmen...
Andy Cockburn, Saul Greenberg
VTC
2010
IEEE
183views Communications» more  VTC 2010»
15 years 5 months ago
Joint Subcarrier and Power Allocation for an OFDMA Relay Network with Multicells
—In this paper, we propose a new resource allocation scheme for an OFDMA relay network with multicells. In the proposed scheme, by sharing the channel state information (CSI) bet...
Dongwook Choi, Dongwoo Lee, Jae Hong Lee