Sciweavers

1192 search results - page 56 / 239
» Computing Weakest Readings
Sort
View
SIROCCO
2008
15 years 1 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
SAC
2010
ACM
14 years 9 months ago
A machine-checked soundness proof for an efficient verification condition generator
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
Frédéric Vogels, Bart Jacobs 0002, F...
CVPR
1997
IEEE
16 years 1 months ago
Global Training of Document Processing Systems Using Graph Transformer Networks
We propose a new machine learning paradigm called Graph Transformer Networks that extends the applicability of gradient-based learning algorithms to systems composed of modules th...
Léon Bottou, Yoshua Bengio, Yann LeCun
SRDS
2008
IEEE
15 years 6 months ago
Adaptive Internal Clock Synchronization
Existing clock synchronization algorithms assume a bounded clock reading error. This, in turn, results in an inflexible design that typically requires node crashes whenever the g...
Zbigniew Jerzak, Robert Fach, Christof Fetzer
HPDC
1993
IEEE
15 years 4 months ago
Programming a Distributed System Using Shared Objects
Building the hardware for a high-performance distributed computer system is a lot easier than building its software. In this paper we describe a model for programtributed systems ...
Andrew S. Tanenbaum, Henri E. Bal, M. Frans Kaasho...