1192 search results - page 56 / 239 » Computing Weakest Readings |
131
Voted
SIROCCO
2008
15 years 5 months ago
2008
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. ...
144
Voted
SAC
2010
ACM
15 years 1 months ago
2010
ACM
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...
141
click to vote
CVPR
1997
IEEE
16 years 5 months ago
1997
IEEE
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...
133
Voted
SRDS
2008
IEEE
15 years 10 months ago
2008
IEEE
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...
113
Voted
HPDC
1993
IEEE
15 years 7 months ago
1993
IEEE
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 ...