2796 search results - page 334 / 560 » The coolest path problem |
199
click to vote
VLDB
2007
ACM
16 years 20 days ago
2007
ACM
Testing a database engine has been and continues to be a challenging task. The space of possible SQL queries along with their possible access paths is practically unbounded. Moreo...
182
click to vote
MOBICOM
2006
ACM
16 years 15 days ago
2006
ACM
For data-collection applications in sensor networks, it is important to ensure all data sources have equal (or weighted) access to network bandwidth so that the base stations rece...
169
click to vote
SIGECOM
2006
ACM
16 years 15 days ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
198
click to vote
HPDC
2005
IEEE
16 years 5 days ago
2005
IEEE
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
178
click to vote
INFOCOM
2005
IEEE
16 years 4 days ago
2005
IEEE
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...