13987 search results - page 523 / 2798 » The Two Guards Problem |
165
click to vote
ECP
1999
Springer
15 years 11 months ago
1999
Springer
In this paper we study the consistency problem for a set of disjunctive temporal constraints [Stergiou and Koubarakis, 1998]. We propose two SAT-based procedures, and show that—o...
146
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
We show that the marked version of the Post Correspondence Problem, where the words on a list are required to di er in the rst letter, is decidable. On the other hand, PCP remains ...
169
click to vote
VLDB
1999
ACM
15 years 11 months ago
1999
ACM
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
171
click to vote
ICPP
1996
IEEE
15 years 11 months ago
1996
IEEE
Abstract - Three dimensional computed tomography is a computationally intensive procedure, requiring large amounts of R A M and processing power. Parallel methods for two dimension...
189
click to vote
DAC
1994
ACM
15 years 11 months ago
1994
ACM
Abstract - We propose a new algorithm for the performancedriven interconnect design problem, based on alphabetic trees. The interconnect topology is determined in a global manner a...