Sciweavers

1061 search results - page 25 / 213
» Natural Selection in Relation to Complexity
Sort
View
ENTCS
2006
153views more  ENTCS 2006»
13 years 7 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu
VLDB
1999
ACM
112views Database» more  VLDB 1999»
13 years 12 months ago
Context-Based Prefetch for Implementing Objects on Relations
When implementing persistent objects on a relational database, a major performance issue is prefetching data to minimize the number of roundtrips to the database. This is especial...
Philip A. Bernstein, Shankar Pal, David Shutt
ISSAC
2007
Springer
131views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Some recent progress in exact linear algebra and related questions
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
Gilles Villard
GECCO
2009
Springer
190views Optimization» more  GECCO 2009»
13 years 11 months ago
Genetic programming for protein related text classification
Since the genomics revolution, bioinformatics has never been so popular. Many researchers have investigated with great success the use of evolutionary computation in bioinformatic...
Marc Segond, Cyril Fonlupt, Denis Robilliard
NIPS
2003
13 years 9 months ago
Link Prediction in Relational Data
Many real-world domains are relational in nature, consisting of a set of objects related to each other in complex ways. This paper focuses on predicting the existence and the type...
Benjamin Taskar, Ming Fai Wong, Pieter Abbeel, Dap...