Sciweavers

10575 search results - page 2105 / 2115
» Programming Languages
Sort
View
FOCS
1998
IEEE
15 years 1 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
OOPSLA
1999
Springer
15 years 1 months ago
Age-Based Garbage Collection
Modern generational garbage collectors look for garbage among the young objects, because they have high mortality; however, these objects include the very youngest objects, which ...
Darko Stefanovic, Kathryn S. McKinley, J. Eliot B....
DAC
1998
ACM
15 years 1 months ago
OCCOM: Efficient Computation of Observability-Based Code Coverage Metrics for Functional Verification
—Functional simulation is still the primary workhorse for verifying the functional correctness of hardware designs. Functional verification is necessarily incomplete because it i...
Farzan Fallah, Srinivas Devadas, Kurt Keutzer
VLDB
1998
ACM
102views Database» more  VLDB 1998»
15 years 1 months ago
Using Schema Matching to Simplify Heterogeneous Data Translation
A broad spectrum of data is available on the Web in distinct heterogeneous sources, and stored under different formats. As the number of systems that utilize this heterogeneous da...
Tova Milo, Sagit Zohar
ZUM
1997
Springer
125views Formal Methods» more  ZUM 1997»
15 years 1 months ago
A Formal OO Method Inspired by Fusion and Object-Z
We present a new formal OO method, called FOX, which is a synergetic combination of the semi-formal Fusion method and the formal specification language Object-Z. To manage complex...
Klaus Achatz, Wolfram Schulte
« Prev « First page 2105 / 2115 Last » Next »