1927 search results - page 75 / 386 » UMDAs for dynamic optimization problems |
108
click to vote
ESA
2005
Springer
15 years 6 months ago
2005
Springer
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
117
Voted
INFOCOM
2012
IEEE
13 years 3 months ago
2012
IEEE
—We study two convex optimization problems in a multi-class M/G/1 queue with adjustable service rates: minimizing convex functions of the average delay vector, and minimizing ave...
IROS
2006
IEEE
15 years 6 months ago
2006
IEEE
— This paper addresses a method to optimize the robot motion planning in dynamic environments, avoiding the moving and static obstacles while the robot drives towards the goal. T...
AAAI
2008
15 years 3 months ago
2008
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...
125
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Cooperative coevolution is often used to solve difficult optimization problems by means of problem decomposition. Its performance on this task is influenced by many design decisio...