2796 search results - page 178 / 560 » The coolest path problem |
196
click to vote
WINET
2010
15 years 4 months ago
2010
Abstract In this work we study the combination of multicost routing and adjustable transmission power in wireless ad hoc networks, so as to obtain dynamic energy- and interference-...
175
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
165
click to vote
ICRA
1993
IEEE
15 years 10 months ago
1993
IEEE
Navigationalpath planning is a classicalproblem in autonomous mobile robotics. Most AI approachesto path planning use goal-directedheuristicsearch of problem spaces defined by spa...
160
click to vote
EMSOFT
2006
Springer
15 years 10 months ago
2006
Springer
The paper deals with the problem of computing schedules for multi-threaded real-time programs. In [14] we introduced a scheduling method based on the geometrization of PV programs...
165
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
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...