Sciweavers

555 search results - page 17 / 111
» A Run-time System for SCOOP
Sort
View
IPTPS
2003
Springer
14 years 22 days ago
Scooped, Again
The Peer-to-Peer (p2p) and Grid infrastructure communities are tackling an overlapping set of problems. In addressing these problems, p2p solutions are usually motivated by elegan...
Jonathan Ledlie, Jeffrey Shneidman, Margo I. Seltz...
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
13 years 2 months ago
A lower bound for distributed averaging algorithms on the line graph
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...
Alexander Olshevsky, John N. Tsitsiklis
ACL
2012
11 years 10 months ago
Heuristic Cube Pruning in Linear Time
We propose a novel heuristic algorithm for Cube Pruning running in linear time in the beam size. Empirically, we show a gain in running time of a standard machine translation syst...
Andrea Gesmundo, Giorgio Satta, James Henderson
ICSOC
2009
Springer
13 years 5 months ago
A Genetic Algorithms-Based Approach for Optimized Self-protection in a Pervasive Service Middleware
With increasingly complex and heterogeneous systems in pervasive service computing, it becomes more and more important to provide self-protected services to end users. In order to ...
Weishan Zhang, Julian Schütte, Mads Ingstrup,...
DAC
2006
ACM
14 years 8 months ago
Behavior and communication co-optimization for systems with sequential communication media
In this paper we propose a new communication synthesis approach targeting systems with sequential communication media (SCM). Since SCMs require that the reading sequence and writi...
Jason Cong, Yiping Fan, Guoling Han, Wei Jiang, Zh...