Sciweavers

3136 search results - page 260 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
GECCO
2006
Springer
220views Optimization» more  GECCO 2006»
15 years 10 months ago
Comparing evolutionary algorithms on the problem of network inference
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different evoluti...
Christian Spieth, Rene Worzischek, Felix Streicher...
NIPS
2007
15 years 8 months ago
Boosting Algorithms for Maximizing the Soft Margin
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
Manfred K. Warmuth, Karen A. Glocer, Gunnar Rä...
GECCO
2008
Springer
100views Optimization» more  GECCO 2008»
15 years 7 months ago
Optimizing hierarchical menus by genetic algorithm and simulated annealing
Hierarchical menus are now ubiquitous. The performance of the menu depends on many factors: structure, layout, colors and so on. There has been extensive research on novel menus, ...
Shouichi Matsui, Seiji Yamada
ISPAN
1997
IEEE
15 years 10 months ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal
ATAL
2008
Springer
15 years 8 months ago
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
Brammert Ottens, Ulle Endriss