Sciweavers

503 search results - page 75 / 101
» Probabilistic Weighted Automata
Sort
View
FORTE
1996
13 years 10 months ago
Combined Application of SDL-92, OMT, MSC and TTCN
The paper describes the application of SDL-92[1] and OMT[2] to the design of a V5.x Access Network interface. While OMT is used to model the management aspects of the system, typi...
Eurico Inocêncio, Manuel Ricardo, Hitoshi Sa...
SIGPRO
2008
136views more  SIGPRO 2008»
13 years 8 months ago
Estimation of slowly varying parameters in nonlinear systems via symbolic dynamic filtering
This paper introduces a novel method for real-time estimation of slowly varying parameters in nonlinear dynamical systems. The core concept is built upon the principles of symboli...
Venkatesh Rajagopalan, Subhadeep Chakraborty, Asok...
CORR
2011
Springer
193views Education» more  CORR 2011»
13 years 3 months ago
Advice Coins for Classical and Quantum Computation
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
Scott Aaronson, Andrew Drucker
PE
2011
Springer
214views Optimization» more  PE 2011»
13 years 3 months ago
Time-bounded reachability in tree-structured QBDs by abstraction
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
Daniel Klink, Anne Remke, Boudewijn R. Haverkort, ...
QEST
2010
IEEE
13 years 6 months ago
Timed Branching Processes
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...
Ashutosh Trivedi, Dominik Wojtczak