Sciweavers

805 search results - page 68 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
93
Voted
IDEAS
2002
IEEE
135views Database» more  IDEAS 2002»
15 years 3 months ago
On Implicate Discovery and Query Optimization
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
Kristofer Vorwerk, G. N. Paulley
ANTSW
2008
Springer
15 years 3 days ago
Two-Level ACO for Haplotype Inference Under Pure Parsimony
Abstract. Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genoty...
Stefano Benedettini, Andrea Roli, Luca Di Gaspero
HIS
2008
14 years 11 months ago
Towards a Highly Scalable Hybrid Metaheuristic for Haplotype Inference Under Parsimony
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This ...
Stefano Benedettini, Luca Di Gaspero, Andrea Roli
ISDA
2008
IEEE
15 years 4 months ago
Cultural-Based Genetic Algorithm: Design and Real World Applications
Due to their excellent performance in solving combinatorial optimization problems, metaheuristics algorithms such as Genetic Algorithms (GA), Simulated Annealing (SA) and Tabu Sea...
Mostafa A. El-Hosseini, Aboul Ella Hassanien, Ajit...
AIPS
2006
14 years 11 months ago
Optimal STRIPS Planning by Maximum Satisfiability and Accumulative Learning
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
Zhao Xing, Yixin Chen, Weixiong Zhang