10718 search results - page 792 / 2144 » On the Circuit Implementation Problem |
284
click to vote
GEM
2010
15 years 5 months ago
2010
Abstract-- The problem of allocating defensive weapon resources to hostile targets is an optimization problem of high military relevance. The need for obtaining the solutions in re...
244
click to vote
IEEESCC
2009
IEEE
15 years 5 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
298
click to vote
CAD
2011
Springer
15 years 2 months ago
2011
Springer
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
237
click to vote
SIAMCO
2011
15 years 2 months ago
2011
Abstract. A framework is introduced for the identification of controls for single-class timevarying queueing networks that are asymptotically optimal in the so-called uniform acce...
234
click to vote
CCO
2001
Springer
16 years 4 days 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...