147 search results - page 12 / 30 » Partitioning procedure for polynomial optimization |
ASPDAC
2004
ACM
14 years 1 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
ICPR
2010
IEEE
14 years 1 months ago
2010
IEEE
The paper introduces a framework for clustering data objects in a similarity-based context. The aim is to cluster objects into a given number of classes without imposing a hard pa...
SWAT
2004
Springer
14 years 3 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
CCE
2004
13 years 9 months ago
2004
It is common that external procedures are incorporated into an equation-oriented model when modeling complex chemical process systems. The so-obtained models are called composite ...
ISPD
2005
ACM
14 years 3 months ago
2005
ACM
This paper presents an efficient heuristic algorithm to design a power distribution network of a chip by employing a successive partitioning and grid refinement scheme. In an it...