Sciweavers

3319 search results - page 243 / 664
» Type Theoretical Databases
Sort
View
88
Voted
GECCO
2003
Springer
15 years 4 months ago
Efficiency and Reliability of DNA-Based Memories
Associative memories based on DNA-affinity have been proposed [2]. Here, the performance, efficiency, reliability of DNA-based memories is quantified through simulations in silico....
Max H. Garzon, Andrew Neel, Hui Chen
ISMIS
2003
Springer
15 years 4 months ago
Comparing Simplification Methods for Model Trees with Regression and Splitting Nodes
In this paper we tackle the problem of simplifying tree-based regression models, called model trees, which are characterized by two types of internal nodes, namely regression nodes...
Michelangelo Ceci, Annalisa Appice, Donato Malerba
EUROGP
2006
Springer
112views Optimization» more  EUROGP 2006»
15 years 2 months ago
The Halting Probability in Von Neumann Architectures
Abstract. Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved f...
William B. Langdon, Riccardo Poli
EWCBR
2008
Springer
15 years 24 days ago
Instance-Based Label Ranking using the Mallows Model
In this paper, we introduce a new instance-based approach to the label ranking problem. This approach is based on a probability model on rankings which is known as the Mallows mode...
Weiwei Cheng, Eyke Hüllermeier
NIPS
2008
15 years 14 days ago
From Online to Batch Learning with Cutoff-Averaging
We present cutoff averaging, a technique for converting any conservative online learning algorithm into a batch learning algorithm. Most online-to-batch conversion techniques work...
Ofer Dekel