447 search results - page 37 / 90 » Approximation Algorithms for Directed Steiner Problems |
ICMLA
2008
13 years 10 months ago
2008
High dimensionality of belief space in Partially Observable Markov Decision Processes (POMDPs) is one of the major causes that severely restricts the applicability of this model. ...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
COCOA
2009
Springer
14 years 1 months ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
CIE
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present a domain theoretic framework for obtaining exact solutions of linear boundary value problems. Based on the domain of compact real intervals, we show how to app...
IPCCC
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...