1254 search results - page 217 / 251 » Making Hard Problems Harder |
GECCO
2006
Springer
14 years 15 days ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
GECCO
2006
Springer
14 years 15 days ago
2006
Springer
This research examines the behavior of inoperative code (introns) in the evolution of genetically robust solutions. Genetically robust solutions are solutions that are less likely...
ALT
1995
Springer
14 years 13 days ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
ICDT
2010
ACM
14 years 5 days ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
EDBT
2010
ACM
14 years 5 days ago
2010
ACM
The specification of schema mappings has proved to be time and resource consuming, and has been recognized as a critical bottleneck to the large scale deployment of data integrati...