752 search results - page 84 / 151 » Faster approximation algorithms for the minimum latency prob... |
97
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
124
click to vote
WAOA
2005
Springer
15 years 8 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
164
click to vote
HSNMC
2003
Springer
15 years 8 months ago
2003
Springer
Various Internet applications involve multiple parties and usually adopt a one-to-many communication paradigm (multicast). The presence of multiple receivers in a multicast session...
144
click to vote
CATS
2006
15 years 4 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
125
click to vote
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...