Sciweavers

2031 search results - page 82 / 407
» Approximation Algorithms for 2-Stage Stochastic Optimization...
Sort
View
AIPS
2008
13 years 10 months ago
Stochastic Planning with First Order Decision Diagrams
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
Saket Joshi, Roni Khardon
VTC
2006
IEEE
111views Communications» more  VTC 2006»
14 years 2 months ago
Distributed Stochastic Power and Rate Allocation for Energy Minimization in Wireless Sensor Networks
— In this paper, we propose a distributed stochastic algorithm for power and rate allocation in ad hoc wireless sensor networks. The problem we deal with is formulated as a trans...
Chun-Hung Liu, Ari Arapostathis
CORR
2011
Springer
205views Education» more  CORR 2011»
12 years 11 months ago
Algorithms for Implicit Hitting Set Problems
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...
ICASSP
2011
IEEE
12 years 11 months ago
Robust binary least squares: Relaxations and algorithms
Finding the least squares (LS) solution s to a system of linear equations Hs = y where H, y are given and s is a vector of binary variables, is a well known NP-hard problem. In th...
Efthymios Tsakonas, Joakim Jalden, Björn E. O...
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
14 years 1 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom