416 search results - page 45 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
UAI
1997
13 years 10 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
AAAI
2006
13 years 10 months ago
2006
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
ICASSP
2011
IEEE
13 years 12 days ago
2011
IEEE
Efficient design of cognitive radio networks calls for secondary users implementing adaptive resource allocation, which requires knowledge of the channel state information in ord...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
EMO
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Multi-objective evolutionary algorithms (MOEAs) have proven to be a powerful tool for global optimization purposes of deterministic problem functions. Yet, in many real-w...