447 search results - page 57 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
KDD
2010
ACM
13 years 7 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— We consider the scenario of distributed data aggregation in wireless sensor networks, where each sensor can obtain and estimate the information of the whole sensing fi...
FOCS
2004
IEEE
14 years 7 days ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
ICML
2009
IEEE
14 years 3 months ago
2009
IEEE
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...