Sciweavers

1113 search results - page 166 / 223
» Counter Systems for Data Logics
Sort
View
IPPS
2002
IEEE
15 years 9 months ago
Memory-Intensive Benchmarks: IRAM vs. Cache-Based Machines
The increasing gap between processor and memory performance has led to new architectural models for memory-intensive applications. In this paper, we use a set of memory-intensive ...
Brian R. Gaeke, Parry Husbands, Xiaoye S. Li, Leon...
ICCAD
1996
IEEE
92views Hardware» more  ICCAD 1996»
15 years 8 months ago
Generation of BDDs from hardware algorithm descriptions
We propose a new method for generating BDDs from hardware algorithm descriptions written in a programming language. Our system can deal with control structures, such as conditiona...
Shin-ichi Minato
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
15 years 8 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
VL
1995
IEEE
110views Visual Languages» more  VL 1995»
15 years 8 months ago
Heterogeneous Visual Languages-Integrating Visual and Textual Programming
After more than a decade of research, visual languages have still not become everyday programming tools. On a short term, an integration of visual languages with well-established ...
Martin Erwig, Bernd Meyer
SIGMOD
1998
ACM
115views Database» more  SIGMOD 1998»
15 years 9 months ago
Providing Database-like Access to the Web Using Queries Based on Textual Similarity
Most databases contain “name constants” like course numbers, personal names, and place names that correspond to entities in the real world. Previous work in integration of het...
William W. Cohen