3049 search results - page 280 / 610 » On the Convergence of Bound Optimization Algorithms |
138
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
180
click to vote
TCAD
2008
15 years 6 months ago
2008
Detecting symmetries has many applications in logic synthesis that include, amongst other things, technology mapping, deciding equivalence of Boolean functions when the input corre...
206
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—In lattice-coded multiple-input multiple-output (MIMO) systems, optimal decoding amounts to solving the closest vector problem (CVP). Embedding is a powerful technique for the a...
194
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Temporal difference (TD) algorithms are attractive for reinforcement learning due to their ease-of-implementation and use of "bootstrapped" return estimates to make effi...
184
click to vote
TAMC
2009
Springer
16 years 1 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...