Sciweavers

539 search results - page 38 / 108
» An Improved Upper Bound for SAT
Sort
View
FOGA
2011
12 years 11 months ago
Approximating the distribution of fitness over hamming regions
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
CONSTRAINTS
2008
78views more  CONSTRAINTS 2008»
13 years 7 months ago
Boosting Haplotype Inference with Local Search
Abstract. A very challenging problem in the genetics domain is to infer haplotypes from genotypes. This process is expected to identify genes affecting health, disease and response...
Inês Lynce, João Marques-Silva, Steve...
DM
2010
140views more  DM 2010»
13 years 7 months ago
Online Ramsey games for triangles in random graphs
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
József Balogh, Jane Butterfield
INFOCOM
2010
IEEE
13 years 6 months ago
Worst-Case TCAM Rule Expansion
—Designers of TCAMs (ternary CAMs) for packet classification often have to deal with unpredictable sets of rules. These result in highly variable rule expansions, and can only r...
Ori Rottenstreich, Isaac Keslassy
ESA
2010
Springer
172views Algorithms» more  ESA 2010»
13 years 8 months ago
Algorithmic Meta-theorems for Restrictions of Treewidth
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
Michael Lampis