75 search results - page 8 / 15 » On the Strength of Size Limits in Linear Genetic Programming |
MP
2010
13 years 5 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
BMCBI
2010
13 years 6 months ago
2010
Background: The estimation of demographic parameters from genetic data often requires the computation of likelihoods. However, the likelihood function is computationally intractab...
IEEEIAS
2008
IEEE
14 years 1 months ago
2008
IEEE
To achieve high accuracy while lowering false alarm rates are major challenges in designing an intrusion detection system. In addressing this issue, this paper proposes an ensembl...
CP
2004
Springer
14 years 3 days ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
VISSYM
2004
13 years 8 months ago
2004
We propose a flexible approach for the visualization of large, high-dimensional datasets. The raw, highdimensional data is mapped into an abstract 3D distance space using the Fast...