56 search results - page 5 / 12 » Design of a Fast Sequential Decoding Algorithm Based on Dyna... |
CCO
2001
Springer
13 years 10 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...
GECCO
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Improving image quality is the backbone of highly competitive display industry. Contemporary video processing system design is a challenging optimization problem. General...
CEC
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract—In the real world, many applications are nonstationary optimization problems. This requires that optimization algorithms need to not only find the global optimal soluti...
DAC
2005
ACM
14 years 7 months ago
2005
ACM
This paper presents a novel repeater insertion algorithm for the power minimization of realistic interconnect trees under given timing budgets. Our algorithm judiciously combines ...
TKDE
1998
13 years 5 months ago
1998
—We investigate the problem of retrieving similar shapes from a large database; in particular, we focus on medical tumor shapes (“Find tumors that are similar to a given patter...