2243 search results - page 291 / 449 » Contracts for Mobile Processes |
159
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
194
click to vote
PLDI
2003
ACM
15 years 11 months ago
2003
ACM
We propose a low-overhead sampling infrastructure for gathering information from the executions experienced by a program’s user community. Several example applications illustrat...
189
click to vote
WSNA
2003
ACM
15 years 11 months ago
2003
ACM
This paper presents lightweight tree-based synchronization (LTS) methods for sensor networks. First, a single-hop, pair-wise synchronization scheme is analyzed. This scheme requir...
197
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
153
click to vote
SIGUCCS
2000
ACM
15 years 11 months ago
2000
ACM
Every campus department needs computer support, from ordering and setting up new computers to installing software and answering software questions. This is in addition to training...