1299 search results - page 58 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
126
Voted
ICCAD
2004
IEEE
16 years 17 days ago
2004
IEEE
Traditional timing-driven placement considers only combinational delays and does not take into account the potential of subsequent sequential optimization steps. As a result, the ...
129
Voted
JOIN
2007
15 years 3 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
134
Voted
COMGEO
2011
ACM
14 years 10 months ago
2011
ACM
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the follo...
104
Voted
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Bottom-up evaluation is a central part of query evaluation / program execution in deductive databases. It is used after a source code optimization like magic sets or SLDm...
159
Voted
ORDER
2010
15 years 2 months ago
2010
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...