19 search results - page 2 / 4 » The Equivalence between Ordinal Optimization in Deterministi... |
APIN
1999
13 years 5 months ago
1999
The problem of figure-ground separation is tackled from the perspective of combinatorial optimization. Previous attempts have used deterministic optimization techniques based on re...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
In multi-input multi-output (MIMO) detection, semidefinite relaxation (SDR) has been shown to be an efficient high-performance approach. For BPSK and QPSK, it has been found that S...
COLT
2010
Springer
13 years 3 months ago
2010
Springer
Multiarmed bandit problem is a typical example of a dilemma between exploration and exploitation in reinforcement learning. This problem is expressed as a model of a gambler playi...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The behavior of some stochastic chemical reaction networks is largely unaffected by slight inaccuracies in reaction rates. We formalize the robustness of state probabilities to re...