4114 search results - page 104 / 823 » Efficient Algorithms for the 2-Center Problems |
122
Voted
ENTCS
2008
15 years 5 months ago
2008
Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quant...
139
Voted
IMCSIT
2010
14 years 11 months ago
2010
We formulate a novel problem of summarising entities with limited presentation budget on entity-relationship knowledge graphs and propose an efficient algorithm for solving this pr...
172
Voted
BMCBI
2011
14 years 8 months ago
2011
Background: Over the past few years, new massively parallel DNA sequencing technologies have emerged. These platforms generate massive amounts of data per run, greatly reducing th...
134
Voted
ACL
2006
15 years 6 months ago
2006
We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mut...
146
click to vote
EOR
2010
15 years 5 months ago
2010
In this work we study the Capacitated p-Center Problem (CpCP) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP, and we pro...