Sciweavers

728 search results - page 104 / 146
» Bargaining with incomplete information
Sort
View
LPNMR
2009
Springer
14 years 2 months ago
The Complexity of Circumscriptive Inference in Post's Lattice
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
Michael Thomas
ACSC
2007
IEEE
14 years 2 months ago
On Inferences of Full Hierarchical Dependencies
Full hierarchical dependencies (FHDs) constitute a large class of relational dependencies. A relation exhibits an FHD precisely when it can be decomposed into at least two of its ...
Sven Hartmann, Sebastian Link
ECRTS
2006
IEEE
14 years 1 months ago
Sensitivity Analysis for Fixed-Priority Real-Time Systems
At early stages in the design of real-time embedded applications, the timing attributes of the computational activities are often incompletely specified or subject to changes. Lat...
Enrico Bini, Marco Di Natale, Giorgio C. Buttazzo
IEEESCC
2006
IEEE
14 years 1 months ago
Using Assumptions in Service Composition Context
Service composition aims to provide an efficient and accurate model of a service, based on which the global service oriented architecture (SOA) can be realized, allowing value add...
Zheng Lu, Aditya Ghose, Peter Hyland, Ying Guan
INFOSCALE
2006
ACM
14 years 1 months ago
A library of constructive skeletons for sequential style of parallel programming
Abstract— With the increasing popularity of parallel programming environments such as PC clusters, more and more sequential programmers, with little knowledge about parallel arch...
Kiminori Matsuzaki, Hideya Iwasaki, Kento Emoto, Z...