1064 search results - page 143 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
217
Voted
ICDE
2012
IEEE
13 years 6 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
131
click to vote
WABI
2009
Springer
15 years 10 months ago
2009
Springer
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
132
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
241
click to vote
FCCM
2011
IEEE
14 years 8 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
134
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...