Sciweavers

170 search results - page 16 / 34
» A Bounding Quantifier
Sort
View
ENTCS
2006
123views more  ENTCS 2006»
14 years 11 months ago
From Discrete Duration Calculus to Symbolic Automata
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
Laure Gonnord, Nicolas Halbwachs, Pascal Raymond
CAD
2007
Springer
14 years 11 months ago
A formal theory for estimating defeaturing-induced engineering analysis errors
Defeaturing is a popular CAD/ CAE simplification technique where ‘small or irrelevant features’ are suppressed within a CAD model for speeding-up downstream processes, especia...
Sankara Hari Gopalakrishnan, Krishnan Suresh
AML
2005
104views more  AML 2005»
14 years 11 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
TIFS
2008
136views more  TIFS 2008»
14 years 11 months ago
Distributed Detection of Information Flows
Abstract--Distributed detection of information flows is considered in which traffic sensors at different locations of a network observe transmission epochs. The traffic sensors com...
Ting He, Lang Tong
88
Voted
NETWORKS
2010
14 years 10 months ago
A mean-variance model for the minimum cost flow problem with stochastic arc costs
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
Stephen D. Boyles, S. Travis Waller