Sciweavers

1672 search results - page 287 / 335
» Tightness problems in the plane
Sort
View
WSNA
2003
ACM
14 years 2 months ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
14 years 1 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
DAGSTUHL
2007
13 years 11 months ago
Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy
Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...
Leah Epstein
DAGSTUHL
2001
13 years 11 months ago
Decision-Theoretic Control of Planetary Rovers
Planetary rovers are small unmanned vehicles equipped with cameras and a variety of sensors used for scientific experiments. They must operate under tight constraints over such res...
Shlomo Zilberstein, Richard Washington, Daniel S. ...
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 9 months ago
Message-passing for Maximum Weight Independent Set
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky