1982 search results - page 249 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
128
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
160
click to vote
FOCS
2005
IEEE
15 years 8 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
179
click to vote
WOSP
1998
ACM
15 years 7 months ago
1998
ACM
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
155
click to vote
MATA
2000
Springer
15 years 6 months ago
2000
Springer
Extensive research on mobile agents has been rife with the growing interests in network computing. In this paper, we have discussed a mobile multi-agent-based framework to address ...
126
click to vote
ICS
2007
Tsinghua U.
15 years 9 months ago
2007
Tsinghua U.
Positive results from new object-oriented tools for scientific programming are reported. Using template classes, abstractions of matrix representations are available that subsume...