Sciweavers

10901 search results - page 161 / 2181
» Approximations in Distributed Optimization
Sort
View
AIPS
2009
15 years 7 months ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...
PODC
2005
ACM
16 years 1 days ago
Quorum placement in networks to minimize access delays
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...
Anupam Gupta, Bruce M. Maggs, Florian Oprea, Micha...
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
16 years 6 months ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh
GECCO
2009
Springer
117views Optimization» more  GECCO 2009»
15 years 11 months ago
BBOB-benchmarking a simple estimation of distribution algorithm with cauchy distribution
The restarted estimation of distribution algorithm (EDA) with Cauchy distribution as the probabilistic model is tested on the BBOB 2009 testbed. These tests prove that when using ...
Petr Posik