Sciweavers

310 search results - page 49 / 62
» Randomized Binary Search Trees
Sort
View
CPAIOR
2005
Springer
14 years 3 months ago
Computing Explanations for the Unary Resource Constraint
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...
Petr Vilím
COMCOM
2004
149views more  COMCOM 2004»
13 years 9 months ago
Accelerating network security services with fast packet classification
To protect a network, secure network systems such as intrusion detection system (IDS) and firewall are often installed to control or monitor network traffic. These systems often i...
Shiuh-Pyng Shieh, Fu-Yuan Lee, Ya-Wen Lin
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
14 years 3 months ago
Schema disruption in tree-structured chromosomes
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
William A. Greene
BMCBI
2006
116views more  BMCBI 2006»
13 years 10 months ago
Whole genome association mapping by incompatibilities and local perfect phylogenies
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
Thomas Mailund, Søren Besenbacher, Mikkel H...
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
14 years 1 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley