Sciweavers

427 search results - page 61 / 86
» Computing the Local Consensus of Trees
Sort
View
SPAA
2010
ACM
15 years 4 months ago
Basic network creation games
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
Noga Alon, Erik D. Demaine, MohammadTaghi Hajiagha...
DIALM
2004
ACM
161views Algorithms» more  DIALM 2004»
15 years 3 months ago
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad
TPDS
2008
175views more  TPDS 2008»
14 years 11 months ago
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
Olivier Beaumont, Larry Carter, Jeanne Ferrante, A...
DAC
2005
ACM
16 years 21 days ago
Freeze: engineering a fast repeater insertion solver for power minimization using the ellipsoid method
This paper presents a novel repeater insertion algorithm for the power minimization of realistic interconnect trees under given timing budgets. Our algorithm judiciously combines ...
Yuantao Peng, Xun Liu
83
Voted
PODS
2008
ACM
110views Database» more  PODS 2008»
15 years 12 months ago
Static analysis of active XML systems
Active XML is a high-level specification language tailored to dataintensive, distributed, dynamic Web services. Active XML is based on XML documents with embedded function calls. ...
Serge Abiteboul, Luc Segoufin, Victor Vianu