Sciweavers

86 search results - page 11 / 18
» Computability and Complexity Issues of Extended RDF
Sort
View
SDM
2009
SIAM
204views Data Mining» more  SDM 2009»
14 years 6 months ago
Application of Bayesian Partition Models in Warranty Data Analysis.
Automotive companies are forced to continuously extend and improve their product line-up. However, increasing diversity, higher design complexity, and shorter development cycles c...
Axel Blumenstock, Christoph Schlieder, Markus M&uu...
WOA
2001
13 years 10 months ago
Multi-Agent Systems as Composition of Observable Systems
Observation is becoming a crucial issue in the engineering of today's systems: the common practice for dealing with their complexity is to encapsulate their subcomponents abs...
Mirko Viroli, Andrea Omicini
TCOM
2008
74views more  TCOM 2008»
13 years 8 months ago
Stability of a frame-based oldest-cell-first maximal weight matching algorithm
Abstract-- Input-queued cell switches employing the oldestcell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is ...
Xike Li, Itamar Elhanany
FUIN
2000
71views more  FUIN 2000»
13 years 8 months ago
The Nondeterministic Information Logic NIL is PSPACE-complete
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
Stéphane Demri
DLT
2009
13 years 6 months ago
Branching-Time Temporal Logics with Minimal Model Quantifiers
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
Fabio Mogavero, Aniello Murano