442 search results - page 64 / 89 » Discovering Heuristic Strategy for Solving Scheduling Proble... |
125
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Credit institutions are seldom faced with problems dealing with single objectives. Often, decisions involving optimizing two or more competing goals simultaneously need to be made...
129
Voted
IANDC
2006
15 years 3 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
162
Voted
ICPPW
2007
IEEE
15 years 10 months ago
2007
IEEE
We study the role of task-level scheduling in power management on multicore multiple voltage embedded systems. Multicore on-achip, in particular DSP systems, can greatly improve p...
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...
134
Voted
EVOW
2004
Springer
15 years 9 months ago
2004
Springer
Genetic Algorithms (GAs) are well-known heuristic algorithms and have been widely applied to solve combinatorial problems. Edge recombination is one of the famous crossovers design...