Sciweavers

709 search results - page 17 / 142
» Real-World Limits to Algorithmic Intelligence
Sort
View
EVOW
2007
Springer
15 years 3 months ago
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
Christian Blum, Carlos Cotta, Antonio J. Fern&aacu...
CEC
2005
IEEE
15 years 3 months ago
Linear genetic programming using a compressed genotype representation
This paper presents a modularization strategy for linear genetic programming (GP) based on a substring compression/substitution scheme. The purpose of this substitution scheme is t...
Johan Parent, Ann Nowé, Kris Steenhaut, Ann...
AMAI
2004
Springer
15 years 3 months ago
Generalized Opinion Pooling
In this paper we analyze the problem of opinion pooling. We introduce a divergence minimization framework to solve the problem of standard opinion pooling. Our results show that v...
Ashutosh Garg, T. S. Jayram, Shivakumar Vaithyanat...
AIPS
2006
14 years 11 months ago
Spacetrack: Trading off Quality and Utilization in Oversubscribed Schedules
Many scheduling problems are posed as optimization problems where the goal is to find a feasible schedule that maximizes the utilization of some resource. In some domains it is al...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
BMCBI
2011
14 years 1 months ago
PeakRanger: A cloud-enabled peak caller for ChIP-seq data
Background: Chromatin immunoprecipitation (ChIP), coupled with massively parallel short-read sequencing (seq) is used to probe chromatin dynamics. Although there are many algorith...
Xin Feng, Robert Grossman, Lincoln Stein