Sciweavers

6167 search results - page 1137 / 1234
» Can Refinement be Automated
Sort
View
AAAI
1998
13 years 11 months ago
Leveled Commitment Contracts with Myopic and Strategic Agents
In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding, i.e., impossible to breach. Such contracts do not allow the agent...
Martin Andersson, Tuomas Sandholm
TC
1998
13 years 11 months ago
Propagating Integrity Information among Interrelated Databases
Data integrity policies often require that quality and integrity metadata be generated and communicated to potential users. However, in data warehouses, federations, and other mul...
Arnon Rosenthal, Edward Sciore
IJCAI
1993
13 years 11 months ago
A New Logical framework for Deductive Planning
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
Werner Stephan, Susanne Biundo
NIPS
1996
13 years 11 months ago
Predicting Lifetimes in Dynamically Allocated Memory
Predictions oflifetimesofdynamicallyallocated objects can be used to improve time and space e ciency of dynamic memory management in computer programs. Barrett and Zorn 1993] used...
David A. Cohn, Satinder P. Singh
BPSC
2009
190views Business» more  BPSC 2009»
13 years 11 months ago
Detective Information Flow Analysis for Business Processes
Abstract: We report on ongoing work towards a posteriori detection of illegal information flows for business processes, focusing on the challenges involved in doing so. Resembling ...
Rafael Accorsi, Claus Wonnemann
« Prev « First page 1137 / 1234 Last » Next »