Sciweavers

1301 search results - page 154 / 261
» Bounded Version Vectors
Sort
View
ENTCS
2007
182views more  ENTCS 2007»
13 years 10 months ago
Automated Fault Localization for C Programs
If a program does not fulfill a given specification, a model checker delivers a counterexample, a run which demonstrates the wrong behavior. Even with a counterexample, locating...
Andreas Griesmayer, Stefan Staber, Roderick Bloem
ORL
2008
99views more  ORL 2008»
13 years 10 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
FUIN
2007
86views more  FUIN 2007»
13 years 10 months ago
Relative Nondeterministic Information Logic is EXPTIME-complete
We define a relative version of the logic NIL introduced by Orłowska, Pawlak and Vakarelov and we show that satisfiability is not only decidable but also EXPTIME-complete. Such ...
Stéphane Demri, Ewa Orlowska
AML
2005
104views more  AML 2005»
13 years 10 months ago
Weak theories of linear algebra
Abstract. We investigate the theories LA, LAP, LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize F...
Neil Thapen, Michael Soltys
MCSS
2007
Springer
13 years 10 months ago
An ISS small gain theorem for general networks
We provide a generalized version of the nonlinear small gain theorem for the case of more than two coupled input-to-state stable (ISS) systems. For this result the interconnection...
Sergey Dashkovskiy, Björn Rüffer, Fabian...