Sciweavers

3142 search results - page 417 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
85
Voted
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
15 years 1 months ago
On contract-and-refine transformations between phylogenetic trees
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy ...
103
Voted
ICTAI
1999
IEEE
15 years 4 months ago
Search Strategies for Hybrid Search Spaces
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
Carla P. Gomes, Bart Selman
85
Voted
RECOMB
1998
Springer
15 years 4 months ago
A polyhedral approach to RNA sequence structure alignment
Ribonucleic acid (RNA) is a polymer composed of four bases denoted A, C, G, and U. It is a generally single-stranded molecule where the bases form hydrogen bonds within the same m...
Hans-Peter Lenhof, Knut Reinert, Martin Vingron
74
Voted
IPPS
1994
IEEE
15 years 4 months ago
Efficient Matrix Chain Ordering in Polylog Time
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
Phillip G. Bradford, Gregory J. E. Rawlins, Gregor...
53
Voted
CCCG
2004
15 years 1 months ago
Computing the set of all distant horizons of a terrain
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...
William S. Evans, Daniel Archambault, David G. Kir...