Sciweavers

1920 search results - page 135 / 384
» The Complexity of the A B C Problem
Sort
View
SIAMJO
2000
101views more  SIAMJO 2000»
15 years 6 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
DAC
2003
ACM
16 years 7 months ago
A new enhanced constructive decomposition and mapping algorithm
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
Alan Mishchenko, Xinning Wang, Timothy Kam
WAOA
2004
Springer
112views Algorithms» more  WAOA 2004»
15 years 12 months ago
Online Bin Packing with Resource Augmentation
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
Leah Epstein, Rob van Stee
EWCBR
1998
Springer
15 years 10 months ago
Representation of Failure Context for Diagnosis of Technical Applications
Development and maintenance of a case-base is known to be one of the most difficult problems in real-world application of case-based diagnosis systems. The complexity of large tech...
B. D. Netten
DAC
2010
ACM
15 years 9 months ago
Post-silicon validation opportunities, challenges and recent advances
Post-silicon validation is used to detect and fix bugs in integrated circuits and systems after manufacture. Due to sheer design complexity, it is nearly impossible to detect and ...
Subhasish Mitra, Sanjit A. Seshia, Nicola Nicolici