14548 search results - page 60 / 2910 » The Optimal Path-Matching Problem |
PPSN
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we use the exact model (or dynamical system approach) to describe the standard evolutionary algorithm (EA) as a discrete dynamical system for dynamic optimization pr...
EOR
2010
13 years 7 months ago
2010
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
ANOR
2011
13 years 5 months ago
2011
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
CCE
2011
13 years 1 months ago
2011
During the last 15 years, many mathematical models have been developed in order to solve process operation scheduling problems, using discrete or continuous time representations. ...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
Reinforcement learning addresses the dilemma between exploration to find profitable actions and exploitation to act according to the best observations already made. Bandit proble...