10901 search results - page 123 / 2181 » Approximations in Distributed Optimization |
183
click to vote
AGI
2008
15 years 7 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
199
click to vote
SIAMJO
2011
15 years 23 days ago
2011
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
146
click to vote
CEC
2007
IEEE
16 years 22 days ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
168
click to vote
NIPS
2007
15 years 7 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
169
click to vote
WCNC
2010
IEEE
15 years 10 months ago
2010
IEEE
Abstract—The Nakagami-lognormal distribution is the commonly used composite distribution for modeling multipath fading and shadowing. In this paper1 , simple and new form of dist...