Sciweavers

5316 search results - page 1034 / 1064
» Which Search Problems Are Random
Sort
View
ACMSE
2006
ACM
15 years 2 months ago
Phoenix-based clone detection using suffix trees
A code clone represents a sequence of statements that are duplicated in multiple locations of a program. Clones often arise in source code as a result of multiple cut/paste operat...
Robert Tairas, Jeff Gray
162
Voted
SBBD
2008
256views Database» more  SBBD 2008»
15 years 2 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
103
Voted
ACL
1997
15 years 2 months ago
Co-evolution of Language and of the Language Acquisition Device
A new account of parameter setting during grammatical acquisition is presented in terms of Generalized Categorial Grammar embedded in a default inheritance hierarchy, providing a ...
Ted Briscoe
128
Voted
SODA
1997
ACM
169views Algorithms» more  SODA 1997»
15 years 2 months ago
Partial Matching of Planar Polylines Under Similarity Transformations
Given two planar polylines T and P with n and m edges, respectively, we present an Om2 n2  time, Omn space algorithm to nd portions of the text" T which are similar in sh...
Scott D. Cohen, Leonidas J. Guibas
GECCO
2008
Springer
126views Optimization» more  GECCO 2008»
15 years 1 months ago
The impact of population size on code growth in GP: analysis and empirical validation
The crossover bias theory for bloat [18] is a recent result which predicts that bloat is caused by the sampling of short, unfit programs. This theory is clear and simple, but it ...
Riccardo Poli, Nicholas Freitag McPhee, Leonardo V...
« Prev « First page 1034 / 1064 Last » Next »