Sciweavers

19320 search results - page 439 / 3864
» On the complexity of computing determinants
Sort
View
WSC
2004
15 years 9 months ago
A Probabilistic Total System Approach to the Simulation of Complex Environmental Systems
GoldSim is a powerful and flexible Windows-based computer program for carrying out probabilistic simulations of complex systems to support management and decisionmaking in enginee...
Rick Kossik, Ian Miller
LOGCOM
2010
120views more  LOGCOM 2010»
15 years 6 months ago
Arithmetical Complexity of First-order Predicate Fuzzy Logics Over Distinguished Semantics
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
Franco Montagna, Carles Noguera
SIGSOFT
2002
ACM
16 years 8 months ago
Isolating cause-effect chains from computer programs
Consider the execution of a failing program as a sequence of program states. Each state induces the following state, up to the failure. Which variables and values of a program sta...
Andreas Zeller
DATE
2007
IEEE
89views Hardware» more  DATE 2007»
16 years 2 months ago
Computing synchronizer failure probabilities
— System-on-Chip designs often have a large number of timing domains. Communication between these domains requires synchronization, and the failure probabilities of these synchro...
Suwen Yang, Mark R. Greenstreet
193
Voted
CAISE
2005
Springer
16 years 1 months ago
Computing the Relevant Instances That May Violate an OCL Constraint
Integrity checking is aimed at efficiently determining whether the state of the information base is consistent after the application of a set of structural events. One possible way...
Jordi Cabot, Ernest Teniente