8413 search results - page 288 / 1683 » Ordering Problem Subgoals |
154
click to vote
PPSN
2004
Springer
15 years 12 months ago
2004
Springer
Current Genetic Algorithms can efficiently address order-k separable problems, in which the order of the linkage is restricted to a low value k. Outside this class, there exist hie...
172
click to vote
WSC
2008
15 years 8 months ago
2008
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
157
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
166
click to vote
CEC
2010
IEEE
15 years 6 months ago
2010
IEEE
— Developing a problem-domain independent methodology to automatically generate high performing solving strategies for specific problems is one of the challenging trends on hype...
151
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...