1569 search results - page 14 / 314 » Programming contest strategy |
SIAMJO
2002
14 years 12 months ago
2002
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...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
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...
155
click to vote
SAGA
2009
Springer
15 years 6 months ago
2009
Springer
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...
137
click to vote
ICDAR
2011
IEEE
13 years 12 months ago
2011
IEEE
—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...
108
click to vote
LOPSTR
1995
Springer
15 years 3 months ago
1995
Springer
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...