Sciweavers

4767 search results - page 784 / 954
» Structures for Abstract Rewriting
Sort
View
SEBD
1996
94views Database» more  SEBD 1996»
13 years 11 months ago
Efficient Algorithm for determining the Optimal Execution Strategy for Path Queries in OODBS
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...
Weimin Chen, Karl Aberer
TPCD
1994
157views Hardware» more  TPCD 1994»
13 years 11 months ago
Non-Restoring Integer Square Root: A Case Study in Design by Principled Optimization
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent f abstraction. In this paper we show how a non-...
John W. O'Leary, Miriam Leeser, Jason Hickey, Mark...
SWAP
2007
13 years 11 months ago
Some Experiments on the Usage of a Deductive Database for RDFS Querying and Reasoning
Abstract. Ontologies are pervading many areas of knowledge representation and management. To date, most research efforts have been spent on the development of sufficiently express...
Giovambattista Ianni, Alessandra Martello, Claudio...
WCE
2007
13 years 11 months ago
Utilising Refactoring To Restructure Use-Case Models
—Use case refactoring is one of the recent software engineering techniques that aimed at synthesising and refining use case models. Two new types of use case refactoring are prop...
Ayman Issa
WCE
2007
13 years 11 months ago
A Patch-by-Patch Shape Matching Procedure for Rigid Body Docking
Abstract—Docking simulates molecular interactions. Protein - protein docking, owing to the sizes of molecules, is a very challenging problem. As the number of degrees of freedom ...
Vipin K. Tripathi