291 search results - page 37 / 59 » Factor 2 Approximation Algorithm for the Generalized Steiner... |
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
HICSS
2003
IEEE
14 years 20 days ago
2003
IEEE
—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is ...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...