4218 search results - page 330 / 844 » Complete sets of cooperations |
200
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
212
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. The dependency core calculus (DCC), a simple extension of the computational lambda calculus, captures a common notion of dependency that arises in many programming langua...
226
click to vote
ENGL
2008
15 years 7 months ago
2008
One of the central problems in modern biology is to identify the complete set of interactions among the proteins in a cell. The structural interaction of proteins and their domains...
201
Voted
INFORMATICALT
2006
15 years 7 months ago
2006
In this paper we consider two logics: temporal logic of common knowledge and temporal logic of common belief. These logics involve the discrete time linear temporal logic operators...
134
click to vote
JNS
2008
15 years 7 months ago
2008
We describe a basic framework for studying dynamic scaling that has roots in dynamical systems and probability theory. Within this framework, we study Smoluchowski's coagulat...