Sciweavers

2266 search results - page 382 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
15 years 10 months ago
Methodology to select solutions from the pareto-optimal set: a comparative study
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
José C. Ferreira, Carlos M. Fonseca, Ant&oa...
TON
2002
99views more  TON 2002»
15 years 4 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
ICCBR
2009
Springer
15 years 2 months ago
Constraint-Based Case-Based Planning Using Weighted MAX-SAT
Previous approaches to case-based planning often finds a similar plan case to a new planning problem to adapt to solve the new problem. However, in the case base, there may be some...
Hankui Zhuo, Qiang Yang, Lei Li
RECOMB
2006
Springer
16 years 4 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
RECOMB
2006
Springer
16 years 4 months ago
A Parsimony Approach to Genome-Wide Ortholog Assignment
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving various...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...