Sciweavers

801 search results - page 157 / 161
» Minimal Locked Trees
Sort
View
MSO
2003
14 years 11 months ago
Simulation based Development of Efficient Hardware for Sort based Algorithms
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...
Niklas Hansson, Jay H. Harris
GECCO
2010
Springer
186views Optimization» more  GECCO 2010»
14 years 10 months ago
Genetic rule extraction optimizing brier score
Most highly accurate predictive modeling techniques produce opaque models. When comprehensible models are required, rule extraction is sometimes used to generate a transparent mod...
Ulf Johansson, Rikard König, Lars Niklasson
CORR
2010
Springer
122views Education» more  CORR 2010»
14 years 9 months ago
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
Deeparnab Chakrabarty, Chaitanya Swamy
BMCBI
2006
159views more  BMCBI 2006»
14 years 9 months ago
MultiSeq: unifying sequence and structure data for evolutionary analysis
Background: Since the publication of the first draft of the human genome in 2000, bioinformatic data have been accumulating at an overwhelming pace. Currently, more than 3 million...
Elijah Roberts, John Eargle, Dan Wright, Zaida Lut...
CORR
2006
Springer
153views Education» more  CORR 2006»
14 years 9 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...