Sciweavers

1569 search results - page 14 / 314
» Programming contest strategy
Sort
View
SIAMJO
2002
100views more  SIAMJO 2002»
13 years 9 months ago
Warm-Start Strategies in Interior-Point Methods for Linear Programming
Abstract. We study the situation in which, having solved a linear program with an interiorpoint method, we are presented with a new problem instance whose data is slightly perturbe...
E. Alper Yildirim, Stephen J. Wright
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
14 years 3 months ago
Learned mutation strategies in genetic programming for evolution and adaptation of simulated snakebot
In this work we propose an approach of incorporating learned mutation strategies (LMS) in genetic programming (GP) employed for evolution and adaptation of locomotion gaits of sim...
Ivan Tanev
SAGA
2009
Springer
14 years 4 months ago
Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
Boris Defourny, Damien Ernst, Louis Wehenkel
ICDAR
2011
IEEE
12 years 9 months ago
Ternary Entropy-Based Binarization of Degraded Document Images Using Morphological Operators
—A vast number of historical and badly degraded document images can be found in libraries, public, and national archives. Due to the complex nature of different artifacts, such p...
T. Hoang Ngan Le, Tien D. Bui, Ching Y. Suen
LOPSTR
1995
Springer
14 years 1 months ago
Guiding Program Development Systems by a Connection Based Proof Strategy
We present an automated proof method for constructive logic based on Wallen’s matrix characterization for intuitionistic validity. The proof search strategy extends Bibel’s con...
Christoph Kreitz, Jens Otten, Stephan Schmitt