Sciweavers

315 search results - page 12 / 63
» Shortest path optimization under limited information
Sort
View
CIKM
2007
Springer
13 years 12 months ago
A fast unified optimal route query evaluation algorithm
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
Edward P. F. Chan, Jie Zhang
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
13 years 9 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
GLOBECOM
2010
IEEE
13 years 5 months ago
Cooperative Relay Scheduling under Partial State Information in Energy Harvesting Sensor Networks
Abstract--Sensors equipped with energy harvesting and cooperative communication capabilities are a viable solution to the power limitations of Wireless Sensor Networks (WSNs) assoc...
Huijiang Li, Neeraj Jaggi, Biplab Sikdar
VLDB
2004
ACM
180views Database» more  VLDB 2004»
14 years 1 months ago
Bloom Histogram: Path Selectivity Estimation for XML Data with Updates
Cost-based XML query optimization calls for accurate estimation of the selectivity of path expressions. Some other interactive and internet applications can also benefit from suc...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
CCR
2002
86views more  CCR 2002»
13 years 7 months ago
Hop-by-hop routing algorithms for premium traffic
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
Jun Wang, Klara Nahrstedt