Sciweavers

1174 search results - page 71 / 235
» Derivation of Characteristic Formulae
Sort
View
HYBRID
2009
Springer
15 years 11 months ago
Finite Automata as Time-Inv Linear Systems Observability, Reachability and More
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
Radu Grosu
PKDD
2009
Springer
92views Data Mining» more  PKDD 2009»
15 years 10 months ago
A Generic Approach to Topic Models
This article contributes a generic model of topic models. To define the problem space, general characteristics for this class of models are derived, which give rise to a represent...
Gregor Heinrich
SNPD
2003
15 years 5 months ago
An Industrial Experience in Comparing Manual vs. Automatic Test Cases Generation
We present our experience in automatically deriving a detailed test case plan exclusively using the UML diagrams developed during the analysis and design phases. We consider in pa...
Francesca Basanieri, Pierpaolo Iani, Gaetano Lomba...
WSC
1998
15 years 5 months ago
Application of Simulation Models in Capacity Constrained Rail Corridors
This paper focuses on the practical value of using and selecting rail simulation models to find real solutions to real problems in constrained traffic corridors. It discusses issu...
Robert H. Leilich
CC
2010
Springer
112views System Software» more  CC 2010»
14 years 10 months ago
Random Cnf's are Hard for the Polynomial Calculus
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...
Eli Ben-Sasson, Russell Impagliazzo