628 search results - page 64 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
105
click to vote
JCO
2010
15 years 1 months ago
2010
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...
106
click to vote
ADHOCNOW
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
198
click to vote
IPL
2006
15 years 3 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
117
click to vote
FSTTCS
2005
Springer
15 years 8 months ago
2005
Springer
Monitoring a distributed system to detect a stable property is an important problem with many applications. The problem is especially challenging for a dynamic distributed system b...
109
click to vote
ECML
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we investigate the relation between transfer learning in reinforcement learning with function approximation and supervised learning with concept drift. We present a n...