Results 281 to 290 of about 257,949 (316)
Some of the next articles are maybe not open access.
2017 IEEE International Symposium on Information Theory (ISIT), 2017
Coded caching is a technique that promises huge reductions in network traffic in content-delivery networks. However, the original formulation and several subsequent contributions in the area, assume that the file requests from the users are synchronized, i.e., they arrive at the server at the same time.
Hooshang Ghasemi, Aditya Ramamoorthy
openaire +2 more sources
Coded caching is a technique that promises huge reductions in network traffic in content-delivery networks. However, the original formulation and several subsequent contributions in the area, assume that the file requests from the users are synchronized, i.e., they arrive at the server at the same time.
Hooshang Ghasemi, Aditya Ramamoorthy
openaire +2 more sources
Asynchronous cellular automata and asynchronous automata for pomsets
1998Asynchronous cellular automata and asynchronous automata have been introduced by Zielonka [14] for the study of Mazurkiewicz traces. In [2] Droste & Gastin generalized the first to pomsets. We show that the expressiveness of monadic second order logic and asynchronous cellular automata are different in the class of all pomsets without auto-concurrency.
openaire +1 more source
IEEE Transactions on Computers, 1974
This paper introduces a class of programmable cellular arrays, called control arrays, and presents a technique for programming these arrays to realize asynchronous control systems. Control arrays are two-dimensional uniform networks composed of a collection of identical cells that can be independently programmed to one of two internal states. A control
openaire +2 more sources
This paper introduces a class of programmable cellular arrays, called control arrays, and presents a technique for programming these arrays to realize asynchronous control systems. Control arrays are two-dimensional uniform networks composed of a collection of identical cells that can be independently programmed to one of two internal states. A control
openaire +2 more sources
ASYNCHRONOUS COMBINGS OF GROUPS
International Journal of Algebra and Computation, 1992\textit{S. M. Gersten} and \textit{H. B. Short} [in Ann. Math., II. Ser. 134, 125-158 (1991; Zbl 0744.20035)] proved various results for biautomatic groups. For instance, the conjugacy problem is solvable, centralizers of finite sets are finitely presented, polycyclic subgroups are virtually abelian.
openaire +1 more source
Proceedings of the Seventh IEEE International Workshop on Object-Oriented Real-Time Dependable Systems. (WORDS 2002), 2003
Romain Boichat +2 more
openaire +1 more source
Romain Boichat +2 more
openaire +1 more source
Finite-region asynchronous H∞ control for 2D Markov jump systems
Automatica, 2021Peng Cheng, Shuping He, Xiaoli Luan
exaly
Proceedings Third NASA/DoD Workshop on Evolvable Hardware. EH-2001, 2002
Alexander H. Jackson, Andrew M. Tyrrell
openaire +1 more source
Alexander H. Jackson, Andrew M. Tyrrell
openaire +1 more source