Sciweavers

281 search results - page 41 / 57
» Balancing weight-balanced trees
Sort
View
WAOA
2004
Springer
111views Algorithms» more  WAOA 2004»
14 years 22 days ago
More Powerful and Simpler Cost-Sharing Methods
We provide a new technique to derive group strategyproof mechanisms for the cost-sharing problem. Our technique is simpler and provably more powerful than the existing one based on...
Paolo Penna, Carmine Ventre
COMPSAC
2002
IEEE
14 years 11 days ago
Achieving Scalability in Hierarchical Location Services
Services for locating mobile objects are often organized as a distributed search tree. The advantage of such an organization is that the service can easily scale as a distributed ...
Maarten van Steen, Gerco Ballintijn
DAC
2000
ACM
13 years 11 months ago
Block placement with symmetry constraints based on the O-tree non-slicing representation
The ordered tree (O-tree) representation has recently gained much interest in layout design automation. Different from previous topological representations of non-slicing floorpl...
Yingxin Pang, Florin Balasa, Koen Lampaert, Chung-...
ICDCS
1998
IEEE
13 years 11 months ago
A Protocol and Correctness Proofs for Real-Time High-Performance Broadcast Networks
Novel real-time applications require highperformance real-time distributed systems, and therefore high-performance real-time networks. We examine a Hard Real-Time Distributed Mult...
Jean-François Hermant, Gérard Le Lan...
ECML
2007
Springer
13 years 11 months ago
Modeling Highway Traffic Volumes
Most traffic management and optimization tasks, such as accident detection or optimal vehicle routing, require an ability to adequately model, reason about and predict irregular an...
Tomás Singliar, Milos Hauskrecht