3049 search results - page 124 / 610 » On the Convergence of Bound Optimization Algorithms |
140
click to vote
COCO
2000
Springer
15 years 9 months ago
2000
Springer
We show that the Shortest Path Problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of t...
144
click to vote
NIPS
2004
15 years 6 months ago
2004
We establish a mistake bound for an ensemble method for classification based on maximizing the entropy of voting weights subject to margin constraints. The bound is the same as a ...
130
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
131
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
152
Voted
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
－ In this paper, we propose a Multiobjective Self-adaptive Differential Evolution algorithm with objective-wise learning strategies (OW-MOSaDE) to solve numerical optimization pr...