867 search results - page 88 / 174 » On Optimization of Test Parallelization with Constraints |
CPAIOR
2010
Springer
14 years 12 days ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
NIPS
2008
13 years 10 months ago
2008
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...
TASLP
2008
13 years 9 months ago
2008
Abstract--In this paper, a new model-based algorithm for optimizing the MPEG-Advanced Audio Coder (AAC) in MS-stereo mode is presented. This algorithm is an extension to stereo sig...
CASES
2003
ACM
14 years 2 months ago
2003
ACM
The proliferation of computing technology to low power domains such as hand–held devices has lead to increased interest in portable interface technologies, with particular inter...
ICPP
2002
IEEE
14 years 2 months ago
2002
IEEE
Code size expansion of software-pipelined loops is a critical problem for DSP systems with strict code size constraint. Some ad-hoc code size reduction techniques were used to try...