Sciweavers

526 search results - page 29 / 106
» Efficient Algorithms for Online Decision Problems
Sort
View
EMO
2006
Springer
173views Optimization» more  EMO 2006»
14 years 1 months ago
Differential Evolution versus Genetic Algorithms in Multiobjective Optimization
This paper presents a comprehensive comparison between the performance of state-of-the-art genetic algorithms NSGA-II, SPEA2 and IBEA and their differential evolution based variant...
Tea Tusar, Bogdan Filipic
CVPR
2008
IEEE
15 years 5 days ago
Efficient sequential correspondence selection by cosegmentation
In many retrieval, object recognition and wide baseline stereo methods, correspondences of interest points are established possibly sublinearly by matching a compact descriptor su...
Jan Cech, Jiri Matas, Michal Perdoch
SAC
2005
ACM
14 years 3 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
João Gama, Pedro Medas, Pedro Pereira Rodri...
NIPS
2007
13 years 11 months ago
The Price of Bandit Information for Online Optimization
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
Varsha Dani, Thomas P. Hayes, Sham Kakade
DEDS
2007
87views more  DEDS 2007»
13 years 10 months ago
Diagnosis of Discrete Event Systems Using Decentralized Architectures
Decentralized diagnosis of discrete event systems has received a lot of attention to deal with distributed systems or with systems that may be too large to be diagnosed by one cen...
Yin Wang, Tae-Sic Yoo, Stéphane Lafortune