ARTÍCULO
TITULO

Extensions of the Method of Poles for Code Construction

Beal    
M.-P.    

Resumen

No disponible

 Artículos similares

       
 
Boris Melnikov,Anastasia Nichiporchuk,Marina Trenina,Mikhail Abramyan     Pág. 1 - 8
In discrete optimization problems, we apply algorithms based on extensions of the branch and bound method. These extensions consist in the joint work of several auxiliary heuristic algorithms, they can be referred to different, independent from each othe... ver más

 
Steven Alter     Pág. 1 - 22
This article responds to a need for a socio-technical systems (STS) perspective that fits in a world that has changed greatly over the decades since the socio-technical movement began. This article identifies conditions and paradoxes that limit tradition... ver más

 
Valerij M. Maksimov,Eduard A. Primenko     Pág. 16 - 20
In real practical problems relating to the issue of information security calculations are frequently carried out in the fields of characteristic 2. In modern computing technologies, particularly, the usage of supercomputers, allow us to conduct calculati... ver más

 
Federico Tramarin, Claudio Narduzzi, Stefano Vitturi and Matteo Bertocco    
In factory automation and process control systems, hybrid wired/wireless networks are often deployed to connect devices of difficult reachability such as those mounted on mobile equipment. A widespread implementation of these networks makes use of Access... ver más
Revista: Information

 
A.Yu Gorchakov,V.U. Malkova     Pág. 12 - 17
In this paper, a comparative analysis of four types of processors is performed using the example of the problem of restoring the initial data for the transport equation. The problem is solved by the Levenberg-Marquardt method, which is decomposed into fo... ver más