1927 search results - page 28 / 386 » UMDAs for dynamic optimization problems |
133
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
—In this paper we consider an interacting two-agent sequential decision-making problem consisting of a Markov source process, a causal encoder with feedback, and a causal decoder...
111
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
103
click to vote
EVOW
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. This paper describes a memory enhanced evolutionary algorithm (EA) approach to the dynamic job shop scheduling problem. Memory enhanced EAs have been widely investigated ...
100
click to vote
EOR
2007
15 years 13 days ago
2007
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
126
Voted
HICSS
2003
IEEE
15 years 5 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...