Sciweavers

15485 search results - page 2457 / 3097
» Computing Optimal Subsets
Sort
View
IMC
2003
ACM
16 years 16 days ago
Virtual landmarks for the internet
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
Liying Tang, Mark Crovella
NETGAMES
2003
ACM
16 years 16 days ago
Priority-based distribution trees for application-level multicast
In this paper, we propose a novel multicast routing algorithm that is based on application-level priorities and network characteristics: The application may specify an individual ...
Jürgen Vogel, Jörg Widmer, Dirk Farin, M...
PODC
2003
ACM
16 years 16 days ago
Scalable and dynamic quorum systems
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
Moni Naor, Udi Wieder
PPOPP
2003
ACM
16 years 16 days ago
Compactly representing parallel program executions
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
Ankit Goel, Abhik Roychoudhury, Tulika Mitra
SAC
2003
ACM
16 years 16 days ago
COSAR: Commitment-Oriented "Sense and Respond" System for Microelectronic Manufacturing
Microelectronic manufacturing deals with the efficient coordination of manufacturing processes and owning enterprises along a value chain to provide microelectronic products to cu...
Jun-Jang Jeng, Henry Chang, Jen-Yao Chung
« Prev « First page 2457 / 3097 Last » Next »