2474 search results - page 343 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
134
Voted
CCE
2004
15 years 4 months ago
2004
The problem addressed in this work is to develop a comprehensive mathematical programming model for the efficient scheduling of oil-refinery operations. Our approach is first to d...
167
click to vote
JMLR
2012
13 years 7 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
138
click to vote
ICCAD
2003
IEEE
16 years 1 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
132
Voted
MP
2010
15 years 3 months ago
2010
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
126
click to vote
IJCNN
2006
IEEE
15 years 11 months ago
2006
IEEE
— A key step in many statistical learning methods used in machine learning involves solving a convex optimization problem containing one or more hyper-parameters that must be sel...