ARTÍCULO
TITULO

A probabilistic algorithm for determining the fundamental matrix of a block M/G/1 markov chain

Hunt    
E.    

Resumen

No disponible

 Artículos similares

       
 
Jinghua Li, Ruipu Dong and Wenhao Huang    
In cruise ship manufacturing, it is common practice for prefabricated modular cabin units (PMCU) to be assembled in the workshop and transported to a designated installation location on board the ship. This paper proposed a Radau pseudospectral method ba... ver más
Revista: Applied Sciences

 
Yuji Takubo and Masahiro Kanazaki    
Landing of supersonic transport (SST) suffers from a large uncertainty due to its highly sensitive aerodynamic properties in the subsonic domain, as well as the wind gusts around runways. At the vehicle design stage, a landing trajectory optimization und... ver más
Revista: Aerospace

 
Aristeidis Karras, Christos Karras, Konstantinos C. Giotopoulos, Dimitrios Tsolis, Konstantinos Oikonomou and Spyros Sioutas    
Federated learning (FL) has emerged as a promising technique for preserving user privacy and ensuring data security in distributed machine learning contexts, particularly in edge intelligence and edge caching applications. Recognizing the prevalent chall... ver más
Revista: Information

 
Alexandr Kuznetsov, Mikolaj Karpinski, Ruslana Ziubina, Sergey Kandiy, Emanuele Frontoni, Oleksandr Peliukh, Olga Veselska and Ruslan Kozak    
The problem of nonlinear substitution generation (S-boxes) is investigated in many related works in symmetric key cryptography. In particular, the strength of symmetric ciphers to linear cryptanalysis is directly related to the nonlinearity of substituti... ver más
Revista: Information

 
Nikola Ivkovic, Robert Kudelic and Marin Golub    
Ant colony optimization (ACO) is a well-known class of swarm intelligence algorithms suitable for solving many NP-hard problems. An important component of such algorithms is a record of pheromone trails that reflect colonies? experiences with previously ... ver más
Revista: Algorithms