Sciweavers

28888 search results - page 154 / 5778
» Computability and complexity in analysis
Sort
View
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 10 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
COMGEO
2008
ACM
13 years 8 months ago
Recursive geometry of the flow complex and topology of the flow complex filtration
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
Kevin Buchin, Tamal K. Dey, Joachim Giesen, Matthi...
CIE
2010
Springer
14 years 1 months ago
Circuit Complexity and Multiplicative Complexity of Boolean Functions
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
Arist Kojevnikov, Alexander S. Kulikov
IBERAMIA
1998
Springer
14 years 12 days ago
Bayesian Networks for Reliability Analysis of Complex Systems
This paper presents an extension of Bayesian networks (BN) applied to reliability analysis. We developed a general methodology for modelling reliability of complex systems based o...
José G. Torres-Toledano, Luis Enrique Sucar
ANSS
2006
IEEE
14 years 2 months ago
Simulation and Analysis of Complex Biological Processes: an Organisation Modelling Perspective
This paper explores how the dynamics of complex biological processes can be modelled and simulated as an organisation of multiple agents. This modelling perspective identifies org...
Tibor Bosse, Catholijn M. Jonker, Jan Treur