438 search results - page 49 / 88 » Optimal Solvers for PDE-Constrained Optimization |
105
click to vote
PADO
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We present a high-level approach to array bound check optimization that is neither hampered by recursive functions, nor disabled by the presence of partially redundant ch...
DATE
2010
IEEE
15 years 3 months ago
2010
IEEE
We present a Pareto efficient design method for multi-dimensional optimization of run-time reconfigurable streaming applications on CPU/FPGA platforms, which automatically allocate...
ICCAD
1999
IEEE
15 years 3 months ago
1999
IEEE
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...
COR
2008
14 years 11 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
103
Voted
JMLR
2011
14 years 6 months ago
2011
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...