Result 1 to 20 of 84 total
Terminating Markov renewal processes in view of lifetime model of retreaded tires fitted to trucks. (English)
Bull. Inf. Cybern. 43, 23-39 (2011).
1
Remarks on ideal completion of $\ast$-continuous idempotent left semirings. (English)
Bull. Inf. Cybern. 43, 1-21 (2011).
2
Modelling transition probabilities and duration time for event history data. (English)
Bull. Inf. Cybern. 42, 71-79 (2010).
3
Numerical enclosure for the optimal threshold probability in discounted Markov decision processes. (English)
Bull. Inf. Cybern. 32, No. 1, 81-90 (2000).
4
On limit cycles and transient lengths of cellular automata with threshod rules. (English)
Bull. Inf. Cybern. 32, No. 1, 23-60 (2000).
5
Combinatory logic and $λ$-calculus for classical logic. (English)
Bull. Inf. Cybern. 32, No. 2, 105-121 (2000).
6
Relational aspects of relational database dependencies. (English)
Bull. Inf. Cybern. 32, No. 2, 91-104 (2000).
7
Inverse partition problems. (English)
Bull. Inf. Cybern. 31, No. 1, 67-90 (1999).
8
An optimal assignment problem for multiple objects per period ‒ case of a partially observable Markov chain. (English)
Bull. Inf. Cybern. 31, No. 1, 23-34 (1999).
9
Reliability in concurrent scientific computing for Volterra type equations. (English)
Bull. Inf. Cybern. 31, No. 1, 1-14 (1999).
10
Associative shortest and longest path problems. (English)
Bull. Inf. Cybern. 31, No. 2, 147-163 (1999).
11
On explicit bounds in the error for the $H^1_0$-projection into piecewise polynomial spaces. (English)
Bull. Inf. Cybern. 31, No. 2, 109-115 (1999).
12
A computational verification method of solution with uniqueness for obstacle problems. (English)
Bull. Inf. Cybern. 30, No.1, 133-144 (1998).
13
On behaviors of cellular automata with rule 156. (English)
Bull. Inf. Cybern. 30, No.1, 121-131 (1998).
14
A representation theorem for relation algebras: Concepts of scalar relations and point relations. (English)
Bull. Inf. Cybern. 30, No. 1, 109-119 (1998).
15
The learnability of simple deterministic finite-memory automata via queries. (English)
Bull. Inf. Cybern. 30, No.1, 93-108 (1998).
16
On Armstrong databases for conditional generalized embedded dependencies. (English)
Bull. Inf. Cybern. 30, No.1, 79-91 (1998).
17
An algebraic characterization of cartesian products of fuzzy relations. (English)
Bull. Inf. Cybern. 29, No.1, 105-115 (1997).
18
On associative shortest path problems. (English)
Bull. Inf. Cybern. 29, No.1, 67-81 (1997).
19
Introducing types into elementary formal systems. (English)
Bull. Inf. Cybern. 28, No.1, 79-89 (1996).
20
Result 1 to 20 of 84 total
Start
Contact
Print
General Help
