Sciweavers

1040 search results - page 130 / 208
» Rounding algorithms for covering problems
Sort
View
TCAD
1998
86views more  TCAD 1998»
14 years 9 months ago
Fast heuristic and exact algorithms for two-level hazard-free logic minimization
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
Michael Theobald, Steven M. Nowick
APIN
2006
168views more  APIN 2006»
14 years 10 months ago
Utilizing Genetic Algorithms to Optimize Membership Functions for Fuzzy Weighted Association Rules Mining
It is not an easy task to know a priori the most appropriate fuzzy sets that cover the domains of quantitative attributes for fuzzy association rules mining. In general, it is unre...
Mehmet Kaya, Reda Alhajj
ESA
2007
Springer
130views Algorithms» more  ESA 2007»
15 years 4 months ago
Convex Combinations of Single Source Unsplittable Flows
In the single source unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given digraph. The deman...
Maren Martens, Fernanda Salazar, Martin Skutella
GECCO
2008
Springer
130views Optimization» more  GECCO 2008»
14 years 11 months ago
Fitnessless coevolution
We introduce fitnessless coevolution (FC), a novel method of comparative one-population coevolution. FC plays games between individuals to settle tournaments in the selection pha...
Wojciech Jaskowski, Krzysztof Krawiec, Bartosz Wie...
DSP
2006
14 years 9 months ago
Detection of audio covert channels using statistical footprints of hidden messages
We address the problem of detecting the presence of hidden messages in audio. The detector is based on the characteristics of the denoised residuals of the audio file, which may c...
Hamza Özer, Bülent Sankur, Nasir D. Memo...