Sciweavers

74 search results - page 12 / 15
» Efficiently evolving programs through the search for novelty
Sort
View

Lecture Notes
443views
15 years 5 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
IWC
2000
94views more  IWC 2000»
13 years 7 months ago
Design and evaluation of the alignment stick
Object alignment is one of the basic operations in drawing programs. Current solutions provide mainly three ways for carrying out this operation: either by issuing an alignment co...
Roope Raisamo, Kari-Jouko Räihä
4OR
2010
148views more  4OR 2010»
13 years 6 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
CSL
2010
Springer
13 years 8 months ago
Embedding Deduction Modulo into a Prover
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
Guillaume Burel
NAR
1998
122views more  NAR 1998»
13 years 7 months ago
The PIR-International Protein Sequence Database
The Protein Information Resource (PIR; http://wwwnbrf.georgetown.edu/pir/ ) supports research on molecular evolution, functional genomics, and computational biology by maintaining...
Winona C. Barker, John S. Garavelli, Daniel H. Haf...