7006 search results - page 258 / 1402 » Approximation Algorithms |
166
click to vote
TCBB
2010
15 years 4 months ago
2010
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...
183
click to vote
ESA
2009
Springer
16 years 29 days ago
2009
Springer
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...
173
click to vote
CPM
1999
Springer
15 years 10 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
198
click to vote
WEA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
150
click to vote
FSTTCS
2007
Springer
16 years 16 days ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...