Sciweavers

1450 search results - page 249 / 290
» Fitness Uniform Optimization
Sort
View
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
14 years 3 days 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 ...
PDPTA
2003
14 years 3 days ago
Flexible Approximate String Matching Application on a Heterogeneous Distributed Environment
In this paper, we present three parallel flexible approximate string matching methods on a parallel architecture with heterogeneous workstations to gain supercomputer power at lo...
Panagiotis D. Michailidis, Konstantinos G. Margari...
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
14 years 2 days ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
SODA
1997
ACM
119views Algorithms» more  SODA 1997»
14 years 2 days ago
Map Labeling and Its Generalizations
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...
Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, ...
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 10 months ago
Online Algorithms for the Multi-Armed Bandit Problem with Markovian Rewards
We consider the classical multi-armed bandit problem with Markovian rewards. When played an arm changes its state in a Markovian fashion while it remains frozen when not played. Th...
Cem Tekin, Mingyan Liu