Sciweavers

256 search results - page 34 / 52
» A New Synchronous Lower Bound for Set Agreement
Sort
View
EMSOFT
2007
Springer
14 years 1 months ago
Loosely time-triggered architectures based on communication-by-sampling
We address the problem of mapping a set of processes which communicate synchronously on a distributed platform. The Time Triggered Architecture (TTA) proposed by Kopetz for the co...
Albert Benveniste, Paul Caspi, Marco Di Natale, Cl...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
13 years 12 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
JFP
2010
142views more  JFP 2010»
13 years 6 months ago
Linear type theory for asynchronous session types
Session types support a type-theoretic formulation of structured patterns of communication, so that the communication behaviour of agents in a distributed system can be verified ...
Simon J. Gay, Vasco Thudichum Vasconcelos
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
14 years 12 days ago
Reinforcement learning for games: failures and successes
We apply CMA-ES, an evolution strategy with covariance matrix adaptation, and TDL (Temporal Difference Learning) to reinforcement learning tasks. In both cases these algorithms se...
Wolfgang Konen, Thomas Bartz-Beielstein
ICAPR
2005
Springer
14 years 1 months ago
Texture Exemplars for Defect Detection on Random Textures
We present a new approach to detecting defects in random textures which requires only very few defect free samples for unsupervised training. Each product image is divided into ove...
Xianghua Xie, Majid Mirmehdi