Sciweavers

13603 search results - page 2445 / 2721
» On the Complexity of Computing Treelength
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 7 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
SIGMOD
2007
ACM
153views Database» more  SIGMOD 2007»
16 years 6 months ago
Scaling games to epic proportion
We introduce scalability for computer games as the next frontier for techniques from data management. A very important aspect of computer games is the artificial intelligence (AI)...
Walker M. White, Alan J. Demers, Christoph Koch, J...
MOBISYS
2006
ACM
16 years 6 months ago
FireWxNet: a multi-tiered portable wireless system for monitoring weather conditions in wildland fire environments
In this paper we present FireWxNet, a multi-tiered portable wireless system for monitoring weather conditions in rugged wildland fire environments. FireWxNet provides the fire fig...
Carl Hartung, Richard Han, Carl Seielstad, Saxon H...
MOBIHOC
2004
ACM
16 years 6 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
« Prev « First page 2445 / 2721 Last » Next »