Sciweavers

481 search results - page 53 / 97
» Martin's game: a lower bound for the number of sets
Sort
View
GECCO
2004
Springer
14 years 2 months ago
The Royal Road Not Taken: A Re-examination of the Reasons for GA Failure on R1
Previous work investigating the performance of genetic algorithms (GAs) has attempted to develop a set of fitness landscapes, called “Royal Roads” functions, which should be id...
Brian Howard, John Sheppard
CCCG
2008
13 years 10 months ago
Competitive Search for Longest Empty Intervals
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
Peter Damaschke
DNA
2007
Springer
14 years 2 months ago
Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues
We introduce staged self-assembly of Wang tiles, where tiles can be added dynamically in sequence and where intermediate constructions can be stored for later mixing. This model a...
Erik D. Demaine, Martin L. Demaine, Sándor ...
RECOMB
2008
Springer
14 years 9 months ago
Algorithms for Joint Optimization of Stability and Diversity in Planning Combinatorial Libraries of Chimeric Proteins
Abstract. In engineering protein variants by constructing and screening combinatorial libraries of chimeric proteins, two complementary and competing goals are desired: the new pro...
Wei Zheng, Alan M. Friedman, Chris Bailey-Kellogg
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
14 years 9 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh