Sciweavers

4498 search results - page 450 / 900
» How to Invent Functions
Sort
View
CIE
2009
Springer
16 years 1 months ago
Computable Exchangeable Sequences Have Computable de Finetti Measures
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
Cameron E. Freer, Daniel M. Roy
COMPLEX
2009
Springer
16 years 1 months ago
Characterizing the Structural Complexity of Real-World Complex Networks
Although recent research has shown that the complexity of a network depends on its structural organization, which is linked to the functional constraints the network must satisfy, ...
Jun Wang, Gregory M. Provan
ECSQARU
2009
Springer
16 years 1 months ago
The Probabilistic Interpretation of Model-Based Diagnosis
Model-based diagnosis is the field of research concerned with the problem of finding faults ms by reasoning with abstract models of the systems. Typically, such models offer a ...
Ildikó Flesch, Peter J. F. Lucas
ESAW
2009
Springer
16 years 1 months ago
Programming Organization-Aware Agents
Organizational notions such as roles, norms (e.g., obligations and permissions), and services are increasingly viewed as natural concepts to manage the complexity of software devel...
M. Birna van Riemsdijk, Koen V. Hindriks, Catholij...
FM
2009
Springer
104views Formal Methods» more  FM 2009»
16 years 1 months ago
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
Helmut Seidl, Vesal Vojdani, Varmo Vene