Sciweavers

3020 search results - page 82 / 604
» Optimal partition trees
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 6 months ago
An Algorithm to List All the Fixed-Point Free Involutions on a Finite Set
A fixed-point free involution on a finite set S is defined as a bijection I : S S such as e S, I(I(e)) = e and e S, I(e) = e. In this article, the fixed-point free involutions ...
Cyril Prissette
GLVLSI
2010
IEEE
168views VLSI» more  GLVLSI 2010»
15 years 6 months ago
A revisit to voltage partitioning problem
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...
Tao Lin, Sheqin Dong, Bei Yu, Song Chen, Satoshi G...
FUZZIEEE
2007
IEEE
16 years 13 days ago
Adaptive Optimization of the Number of Clusters in Fuzzy Clustering
In this paper, we present a local, adaptive optimization scheme for adjusting the number of clusters in fuzzy C-means clustering. This method is especially motivated by online app...
Jürgen Beringer, Eyke Hüllermeier
ICALP
1998
Springer
15 years 10 months ago
Optimal Sampling Strategies in Quicksort
It is well known that the performance of quicksort can be improved by selecting the median of a sample of elements as the pivot of each partitioning stage. For large samples the pa...
Conrado Martínez, Salvador Roura
GECCO
2006
Springer
206views Optimization» more  GECCO 2006»
15 years 9 months ago
A dynamically constrained genetic algorithm for hardware-software partitioning
In this article, we describe the application of an enhanced genetic algorithm to the problem of hardware-software codesign. Starting from a source code written in a high-level lan...
Pierre-André Mudry, Guillaume Zufferey, Gia...