675 search results - page 71 / 135 » A parallel search algorithm for CLNS addition optimization |
124
click to vote
ICDCS
2010
IEEE
15 years 4 months ago
2010
IEEE
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
116
Voted
CCO
2001
Springer
15 years 5 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
120
Voted
ISCC
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
141
click to vote
GECCO
2009
Springer
14 years 10 months ago
2009
Springer
The generation of robot controllers for a task requiring a sequence of elementary behaviors is still a challenge. If these behaviors are known, intermediate steps can be given to ...
60
Voted
ISCA
2003
IEEE
15 years 6 months ago
2003
IEEE
Clustered microarchitectures are an attractive alternative to large monolithic superscalar designs due to their potential for higher clock rates in the face of increasingly wire-d...