Sciweavers

662 search results - page 62 / 133
» Formalizing Basic First Order Model Theory
Sort
View
ATVA
2007
Springer
115views Hardware» more  ATVA 2007»
14 years 1 months ago
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...
TIM
2010
144views Education» more  TIM 2010»
13 years 2 months ago
Extending Polynomial Chaos to Include Interval Analysis
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
Antonello Monti, Ferdinanda Ponci, Marco Valtorta
SIGIR
2005
ACM
14 years 1 months ago
Gravitation-based model for information retrieval
This paper proposes GBM (gravitation-based model), a physical model for information retrieval inspired by Newton’s theory of gravitation. A mapping is built in this model from c...
Shuming Shi, Ji-Rong Wen, Qing Yu, Ruihua Song, We...
DKE
1999
87views more  DKE 1999»
13 years 7 months ago
Logical Foundations of Multilevel Databases
In this paper, we propose a formal model for multilevel databases. This model aims at being a generic model, that is it can be interpreted for any kind of database (relational, ob...
Frédéric Cuppens, Alban Gabillon
ANTSW
2006
Springer
13 years 11 months ago
Extending the Particle Swarm Algorithm to Model Animal Foraging Behaviour
The particle swarm algorithm contains elements which map fairly strongly to the foraging problem in behavioural ecology. In this paper, we show how some simple adaptions to the sta...
Cecilia Di Chio, Riccardo Poli, Paolo Di Chio