5089 search results - page 896 / 1018 » Attention |
126
Voted
COMPGEOM
2003
ACM
15 years 8 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...
187
Voted
MOBICOM
2003
ACM
15 years 8 months ago
2003
ACM
The characteristics of ad hoc networks naturally encourage the deployment of distributed services. Although current networks implement group communication methods, they do not sup...
121
Voted
SIGECOM
2003
ACM
15 years 8 months ago
2003
ACM
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
117
Voted
SIGUCCS
2003
ACM
15 years 8 months ago
2003
ACM
In 2002, Harvard University's Division of Continuing Education (DCE) expanded its computer lab facility. This expansion allowed DCE to change its previous policy of restricti...
129
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...