Sciweavers

719 search results - page 131 / 144
» Adaptive Online Time Allocation to Search Algorithms
Sort
View
CEC
2007
IEEE
15 years 4 months ago
Target shape design optimization by evolving splines
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...
Pan Zhang, Xin Yao, Lei Jia, Bernhard Sendhoff, Th...
BIOCOMP
2009
14 years 10 months ago
Improving Remote Homology Detection Using Sequence Properties and Position Specific Scoring Matrices
Current biological sequence comparison tools frequently fail to recognize matches between homologs when sequence similarity is below the twilight zone of less than 25% sequence id...
Gina Cooper, Michael L. Raymer
SIGSOFT
2007
ACM
15 years 10 months ago
Parallel test generation and execution with Korat
We present novel algorithms for parallel testing of code that takes structurally complex test inputs. The algorithms build on the Korat algorithm for constraint-based generation o...
Sasa Misailovic, Aleksandar Milicevic, Nemanja Pet...
ASIACRYPT
2011
Springer
13 years 9 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer
BMCBI
2010
135views more  BMCBI 2010»
14 years 9 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...