Sciweavers

16093 search results - page 52 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
JMLR
2011
137views more  JMLR 2011»
14 years 8 months ago
Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm
In this paper the sequential prediction problem with expert advice is considered for the case where losses of experts suffered at each step cannot be bounded in advance. We presen...
Vladimir V. V'yugin
CDC
2010
IEEE
141views Control Systems» more  CDC 2010»
14 years 8 months ago
A dynamic programming algorithm for decentralized Markov decision processes with a broadcast structure
We give an optimal dynamic programming algorithm to solve a class of finite-horizon decentralized Markov decision processes (MDPs). We consider problems with a broadcast informati...
Jeff Wu, Sanjay Lall
ISQED
2011
IEEE
240views Hardware» more  ISQED 2011»
14 years 4 months ago
Fast optimization of nano-CMOS mixed-signal circuits through accurate metamodeling
—Design optimization methodologies for AMS-SoCs with analog, digital, and mixed-signal portions have not received significant attention, due to their high complexity. In mixed-s...
Oleg Garitselov, Saraju P. Mohanty, Elias Kougiano...
TEC
2010
171views more  TEC 2010»
14 years 8 months ago
A Clustering Particle Swarm Optimizer for Locating and Tracking Multiple Optima in Dynamic Environments
In the real world, many optimization problems are dynamic. This requires an optimization algorithm to not only find the global optimal solution under a specific environment but als...
Shengxiang Yang, Changhe Li
ICASSP
2011
IEEE
14 years 5 months ago
Optimum multi-user detection by nonsmooth optimization
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
Hoang Duong Tuan, Tran Thai Son, Hoang Tuy, Ha H. ...