A general iterative technique for approximate throughput computation of stochastic marked graphs

Author(s):  
J. Campos ◽  
J.M. Colom ◽  
H. Jungnitz ◽  
M. Silva
2001 ◽  
Vol 21 (1) ◽  
pp. 73-84 ◽  
Author(s):  
A. Gharsallah ◽  
A. Gharbi ◽  
H. Baudrand

2017 ◽  
Vol 26 (12) ◽  
pp. 1750081
Author(s):  
Sang Youl Lee

In this paper, we introduce a notion of virtual marked graphs and their equivalence and then define polynomial invariants for virtual marked graphs using invariants for virtual links. We also formulate a way how to define the ideal coset invariants for virtual surface-links using the polynomial invariants for virtual marked graphs. Examining this theory with the Kauffman bracket polynomial, we establish a natural extension of the Kauffman bracket polynomial to virtual marked graphs and found the ideal coset invariant for virtual surface-links using the extended Kauffman bracket polynomial.


2002 ◽  
Vol 9 (2) ◽  
pp. 287-294
Author(s):  
Tadeusz Jankowski

Abstract The method of lower and upper solutions combined with the monotone iterative technique is used for ordinary differential equations with nonlinear boundary conditions. Some existence results are formulated for such problems.


Sign in / Sign up

Export Citation Format

Share Document