10608 search results - page 1809 / 2122 » Complexity of O'Hara's Algorithm |
122
click to vote
AGP
1999
IEEE
15 years 4 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
104
Voted
DAC
1999
ACM
15 years 4 months ago
1999
ACM
This paper presents a design methodology, called common-case computation (CCC), and new design automation algorithms for optimizing power consumption or performance. The proposed ...
106
click to vote
DOLAP
1999
ACM
15 years 4 months ago
1999
ACM
We consider a system in which many users run queries to examine subsets of a large object set. The object set is partitioned into files on tape. A single subset of objects will b...
DFT
1999
IEEE
15 years 4 months ago
1999
IEEE
Fault identification capabilities are becoming increasingly important in modern designs, not only in support of design debugging methodologies, but also for the purpose of process...
101
click to vote
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...