Sciweavers

9051 search results - page 341 / 1811
» On detectability of stochastic systems
Sort
View
211
Voted
QEST
2007
IEEE
16 years 1 months ago
Automated Analysis of Simulation Traces - Separating Progress from Repetitive Behavior
Among the many stages of a simulation study, debugging a simulation model is the one that is hardly reported on but that may consume a considerable amount of time and effort. In t...
Peter Kemper, Carsten Tepper
INFOCOM
2005
IEEE
16 years 1 months ago
A calculus approach to minimum energy transmission policies with quality of service guarantees
— We consider a queueing system with controllable service rate; for example, a transmitter whose rate can be controlled by varying the transmission power. For such a system we ob...
Murtaza Zafer, Eytan Modiano
204
Voted
WOSP
2004
ACM
16 years 27 days ago
Software performance modelling using PEPA nets
Modelling and analysing distributed and mobile software systems is a challenging task. PEPA nets—coloured stochastic Petri nets—are a recently introduced modelling formalism w...
Stephen Gilmore, Jane Hillston, Leïla Kloul, ...
192
Voted
SMA
1993
ACM
107views Solid Modeling» more  SMA 1993»
15 years 11 months ago
Relaxed parametric design with probabilistic constraints
: Parametric design is an important modeling paradigm in computer aided design. Relationships (constraints) between the degrees of freedom (DOFs) of the model, instead of the DOFs ...
Yacov Hel-Or, Ari Rappoport, Michael Werman
CORR
2008
Springer
143views Education» more  CORR 2008»
15 years 7 months ago
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
Abstract. Monotone systems of polynomial equations (MSPEs) are systems of fixedpoint equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomia...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...