Sciweavers

763 search results - page 70 / 153
» Engineering Shortest Path Algorithms
Sort
View
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
13 years 11 months ago
Frugality in path auctions
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
Edith Elkind, Amit Sahai, Kenneth Steiglitz
BIOSTEC
2008
137views Healthcare» more  BIOSTEC 2008»
13 years 11 months ago
Breast Contour Detection with Stable Paths
Abstract. Breast cancer conservative treatment (BCCT), due to its proven oncological safety, is considered, when feasible, the gold standard of breast cancer treatment. However, ae...
Jaime S. Cardoso, Ricardo Sousa, Luís Filip...
BROADNETS
2004
IEEE
14 years 1 months ago
Random Asynchronous Wakeup Protocol for Sensor Networks
This paper presents Random Asynchronous Wakeup (RAW), a power saving technique for sensor networks that reduces energy consumption without significantly affecting the latency or c...
Vamsi Paruchuri, Shivakumar Basavaraju, Arjan Durr...
CGO
2004
IEEE
14 years 1 months ago
Targeted Path Profiling: Lower Overhead Path Profiling for Staged Dynamic Optimization Systems
In this paper, we present a technique for reducing the overhead of collecting path profiles in the context of a dynamic optimizer. The key idea to our approach, called Targeted Pa...
Rahul Joshi, Michael D. Bond, Craig B. Zilles
MOBICOM
2003
ACM
14 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