Sciweavers

144 search results - page 14 / 29
» Stochastic analyses for online combinatorial optimization pr...
Sort
View
APIN
1999
114views more  APIN 1999»
14 years 9 months ago
Evolutionary Approaches to Figure-Ground Separation
The problem of figure-ground separation is tackled from the perspective of combinatorial optimization. Previous attempts have used deterministic optimization techniques based on re...
Suchendra M. Bhandarkar, Xia Zeng
AAAI
1998
14 years 11 months ago
Highest Utility First Search Across Multiple Levels of Stochastic Design
Manydesign problems are solved using multiple levels of abstraction, wherea design at one level has combinatorially manychildren at the next level. A stochastic optimization metho...
Louis I. Steinberg, J. Storrs Hall, Brian D. Davis...
JMLR
2012
13 years 1 days ago
Multi Kernel Learning with Online-Batch Optimization
In recent years there has been a lot of interest in designing principled classification algorithms over multiple cues, based on the intuitive notion that using more features shou...
Francesco Orabona, Jie Luo, Barbara Caputo
INFORMATICALT
2010
101views more  INFORMATICALT 2010»
14 years 8 months ago
An Improved Differential Evolution Scheme for the Solution of Large-Scale Unit Commitment Problems
This paper presents an improved differential evolution (IDE) method for the solution of large-scale unit commitment (UC) problems. The objective of the proposed scheme is to determ...
Chen-Sung Chang
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
15 years 3 months ago
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks