Sciweavers

1569 search results - page 33 / 314
» Programming contest strategy
Sort
View
CCE
2010
13 years 7 months ago
A simple heuristic for reducing the number of scenarios in two-stage stochastic programming
In this work we address the problem of solving multiscenario optimization models that are deterministic equivalents of two-stage stochastic programs. We present a heuristic approx...
Ramkumar Karuppiah, Mariano Martín, Ignacio...
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
14 years 4 months ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
AAAI
2004
13 years 11 months ago
Dynamic Programming for Partially Observable Stochastic Games
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
Eric A. Hansen, Daniel S. Bernstein, Shlomo Zilber...
ACE
2003
97views Education» more  ACE 2003»
13 years 11 months ago
First Year Programming: Let All the Flowers Bloom
We describe our criterion-referenced grading scheme for a first year programming subject, which has been designed to allow all participating students to achieve their full potenti...
Raymond Lister, John Leaney
ICTAI
1999
IEEE
14 years 2 months ago
Search Strategies for Hybrid Search Spaces
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
Carla P. Gomes, Bart Selman