Sciweavers

422 search results - page 52 / 85
» On combinations of CMA equalizers
Sort
View
GECCO
2005
Springer
157views Optimization» more  GECCO 2005»
15 years 3 months ago
Simple addition of ranking method for constrained optimization in evolutionary algorithms
During the optimization of a constrained problem using evolutionary algorithms (EAs), an individual in the population can be described using three important properties, i.e., obje...
Pei Yee Ho, Kazuyuki Shimizu
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Boosting Spectral Partitioning by Sampling and Iteration
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
Joachim Giesen, Dieter Mitsche
ISMIR
2005
Springer
150views Music» more  ISMIR 2005»
15 years 3 months ago
Comparing Pitch Spelling Algorithms
A pitch spelling algorithm predicts the pitch names of the notes in a musical passage when given the onset-time, MIDI note number and possibly the duration and voice of each note....
David Meredith, Geraint A. Wiggins
MFCS
2005
Springer
15 years 3 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
AMAI
2004
Springer
15 years 3 months ago
Using Automatic Case Splits and Efficient CNF Translation to Guide a SAT-solver when Formally Verifying Out-Of-Order Processors
The paper integrates automatically generated case-splitting expressions, and an efficient translation to CNF, in order to formally verify an out-of-order superscalar processor havi...
Miroslav N. Velev