Sciweavers

720 search results - page 116 / 144
» Broadcast scheduling: algorithms and complexity
Sort
View
CORR
2007
Springer
134views Education» more  CORR 2007»
14 years 10 months ago
Web data modeling for integration in data warehouses
In a data warehousing process, the data preparation phase is crucial. Mastering this phase allows substantial gains in terms of time and performance when performing a multidimensio...
Sami Miniaoui, Jérôme Darmont, Omar B...
80
Voted
SSS
2010
Springer
158views Control Systems» more  SSS 2010»
14 years 8 months ago
Low Memory Distributed Protocols for 2-Coloring
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...
95
Voted
MOBICOM
2003
ACM
15 years 3 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
SWAT
2004
Springer
136views Algorithms» more  SWAT 2004»
15 years 3 months ago
The Relative Worst Order Ratio Applied to Seat Reservation
The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for t...
Joan Boyar, Paul Medvedev
93
Voted
ASPLOS
1992
ACM
15 years 2 months ago
Efficient Superscalar Performance Through Boosting
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
Michael D. Smith, Mark Horowitz, Monica S. Lam