Sciweavers

4542 search results - page 714 / 909
» Design patterns for data structures
Sort
View
POPL
1997
ACM
15 years 10 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones
ISSAC
1994
Springer
165views Mathematics» more  ISSAC 1994»
15 years 10 months ago
Constructing Permutation Representations for Large Matrix Groups
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
Gene Cooperman, Larry Finkelstein, Bryant W. York,...
VLDB
1994
ACM
162views Database» more  VLDB 1994»
15 years 10 months ago
NAOS - Efficient and Modular Reactive Capabilities in an Object-Oriented Database System
This paper describes the design and implementation of NAOS, an active rule component in the object-oriented database system 02. The contribution of this work is related to two mai...
Christine Collet, Thierry Coupaye, T. Svensen
WMRD
1990
15 years 10 months ago
Replicated K-Resilient Objects in Arjuna
This paper describes the design of an object replication scheme for the Arjuna distributed system. ThedesignsupportsK-resiliency,where,intheabsenceofnetworkpartitions,Koutofa tota...
Mark C. Little, Santosh K. Shrivastava
ASPDAC
2007
ACM
89views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Trace Compaction using SAT-based Reachability Analysis
In today's designs, when functional verification fails, engineers perform debugging using the provided error traces. Reducing the length of error traces can help the debugging...
Sean Safarpour, Andreas G. Veneris, Hratch Mangass...