Sciweavers

1300 search results - page 217 / 260
» Probabilistic logic with independence
Sort
View
TOMACS
2011
139views more  TOMACS 2011»
14 years 6 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James
TROB
2002
169views more  TROB 2002»
14 years 11 months ago
Constructing reconfigurable software for machine control systems
Reconfigurable software is highly desired for automated machine tool control systems for low-cost products and short time to market. In this paper, we propose a software architectu...
Shige Wang, Kang G. Shin
DAC
2008
ACM
16 years 24 days ago
Bi-decomposing large Boolean functions via interpolation and satisfiability solving
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
Ruei-Rung Lee, Jie-Hong Roland Jiang, Wei-Lun Hung
ADC
2009
Springer
122views Database» more  ADC 2009»
15 years 6 months ago
What is Required in Business Collaboration?
Access control has been studied for sometime, and there are a number of theories and techniques for handling access control for single or centralised systems; however, unique and ...
Daisy Daiqin He, Michael Compton, Kerry Taylor, Ji...
ICEIS
2005
IEEE
15 years 5 months ago
Conditions for Interoperability
Abstract: Interoperability for information systems remains a challenge both at the semantic and organisational levels. The original three-level architecture for local databases nee...
B. Nick Rossiter, Michael A. Heather