1628 search results - page 147 / 326 » Partitioning Sets with Genetic Algorithms |
117
click to vote
EOR
2006
15 years 3 months ago
2006
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
108
click to vote
ICCD
1994
IEEE
15 years 7 months ago
1994
IEEE
Systems for multi-level logic optimization are usually based on a set of specialized, loosely-related transformations which work on a network representation. The sequence of trans...
158
click to vote
SWAT
2010
Springer
15 years 8 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
118
click to vote
DAC
1996
ACM
15 years 7 months ago
1996
ACM
Abstract -- This paper presents a novel, Boolean approach to LUTbased FPGA technology mapping targeting high performance. As the core of the approach, we have developed a powerful ...
121
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...