4112 search results - page 90 / 823 » Efficient Algorithms for the Spoonerism Problem |
125
click to vote
ACL
2006
15 years 5 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...
142
click to vote
EOR
2010
15 years 4 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...
119
click to vote
4OR
2005
15 years 4 months ago
2005
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
127
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...
145
click to vote
IJCSA
2007
15 years 3 months ago
2007
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...