12950 search results - page 73 / 2590 » On Optimal Timed Strategies |
123
Voted
IJCAI
2003
15 years 5 months ago
2003
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
163
Voted
CSL
2008
Springer
15 years 5 months ago
2008
Springer
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...
132
Voted
IJCNN
2006
IEEE
15 years 9 months ago
2006
IEEE
— The optimization of classification systems is often confronted by the solution over-fit problem. Solution over-fit occurs when the optimized classifier memorizes the traini...
126
Voted
ATMOS
2007
15 years 5 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
147
Voted
HEURISTICS
2002
15 years 3 months ago
2002
In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strate...