Sciweavers

6142 search results - page 1195 / 1229
» The Complexity of Partition Functions
Sort
View
AI
2006
Springer
13 years 8 months ago
Backward-chaining evolutionary algorithms
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
Riccardo Poli, William B. Langdon
ENTCS
2008
146views more  ENTCS 2008»
13 years 8 months ago
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Michael J. A. Smith
BMCBI
2006
170views more  BMCBI 2006»
13 years 8 months ago
Biclustering of gene expression data by non-smooth non-negative matrix factorization
Background: The extended use of microarray technologies has enabled the generation and accumulation of gene expression datasets that contain expression levels of thousands of gene...
Pedro Carmona-Saez, Roberto D. Pascual-Marqui, Fra...
BMCBI
2006
99views more  BMCBI 2006»
13 years 8 months ago
A proposed metric for assessing the measurement quality of individual microarrays
Background: High-density microarray technology is increasingly applied to study gene expression levels on a large scale. Microarray experiments rely on several critical steps that...
Kyoungmi Kim, Grier P. Page, T. Mark Beasley, Step...
GPEM
2008
128views more  GPEM 2008»
13 years 8 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
« Prev « First page 1195 / 1229 Last » Next »