2182 search results - page 290 / 437 » A Robust Algorithm for Solving Nonlinear Programming Problem... |
121
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
124
Voted
IPPS
1996
IEEE
15 years 6 months ago
1996
IEEE
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
122
Voted
RECOMB
2005
Springer
16 years 2 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
123
Voted
WINE
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
110
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...