10901 search results - page 301 / 2181 » Approximations in Distributed Optimization |
150
click to vote
ICMCS
2006
IEEE
16 years 21 days ago
2006
IEEE
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
165
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...
203
Voted
DISOPT
2010
15 years 6 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
149
click to vote
SIAMCO
2000
15 years 6 months ago
2000
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...
179
click to vote
ATAL
2005
Springer
16 years 6 days ago
2005
Springer
State estimation consists of updating an agent’s belief given executed actions and observed evidence to date. In single agent environments, the state estimation can be formalize...