Sciweavers

4074 search results - page 743 / 815
» Abstract Graph Transformation
Sort
View
POPL
1996
ACM
15 years 2 months ago
A Provably Time-Efficient Parallel Implementation of Full Speculation
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
John Greiner, Guy E. Blelloch
STOC
1996
ACM
92views Algorithms» more  STOC 1996»
15 years 2 months ago
Constructing Evolutionary Trees in the Presence of Polymorphic Characters
Abstract. Most phylogenetics literature and construction methods based upon characters presume monomorphism (one state per character per species), yet polymorphism (multiple states...
Maria Luisa Bonet, Cynthia A. Phillips, Tandy Warn...
DAC
1994
ACM
15 years 2 months ago
Automatic Verification of Pipelined Microprocessors
Abstract - We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology wh...
Vishal Bhagwati, Srinivas Devadas
ECAI
1994
Springer
15 years 2 months ago
Concept Language with Number Restrictions and Fixpoints, and its Relationship with Mu-calculus
Abstract. Many recent works point out that there are several possibilities of assigning a meaning to a concept definition containing some sort of recursion. In this paper, we argue...
Giuseppe De Giacomo, Maurizio Lenzerini
CP
2007
Springer
15 years 1 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti