Sciweavers

2736 search results - page 409 / 548
» Implementable allocation rules
Sort
View
HICSS
1998
IEEE
97views Biometrics» more  HICSS 1998»
15 years 6 months ago
CAFE: A Conceptual Model for Managing Information in Electronic Mail
The design and implementation of a conceptual model, CAFE (a Categorization Assistant For E-mail), is described. The model supports the organization, searching, and retrieval of i...
Juha Takkinen, Nahid Shahmehri
VLDB
1999
ACM
136views Database» more  VLDB 1999»
15 years 6 months ago
O-O, What Have They Done to DB2?
In this paper, we describe our recent experiences in adding a number of object-relational extensions to the DB2 Universal Database UDB system as part of a research and developme...
Michael J. Carey, Donald D. Chamberlin, Srinivasa ...
KBSE
1997
IEEE
15 years 6 months ago
NORA/HAMMR: Making Deduction-Based Software Component Retrieval Practical
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
Johann Schumann, Bernd Fischer 0002
TOOLS
1997
IEEE
15 years 6 months ago
Mapping the OO-Jacobson Approach into Function Point Analysis
Function Point Analysis measures user requested functionality independent of the technology used for implementation. Software applications are represented stract model that contai...
T. Fetcke, A. Abran, T.-H. Nguyen
SIGSOFT
1994
ACM
15 years 6 months ago
Reengineering a Complex Application Using a Scalable Data Structure Compiler
1 P2 is a scalable compiler for collection data structures. High-level ions insulate P2 users from data structure implementation details. By specifying a target data structure as a...
Don S. Batory, Jeff Thomas, Marty Sirkin