Results 251 to 260 of about 15,257,248 (287)
Some of the next articles are maybe not open access.
Modern Random Access Protocols
Foundations and Trends® in Networking, 2016Random access represents possibly the simplest and yet one of the best known approaches for sharing a channel among several users. Since their introduction in the 1970s, random access schemes have been thoroughly studied and small variations of the pioneering Aloha protocol have since then become a key component of many communications standards ...
Matteo Berioli +3 more
openaire +2 more sources
Journal of Visual Impairment & Blindness, 1986
A monthly section highlighting the impact of technological development on consumers and the blindness/visual impairment field. We need your support. Please send news, reviews, and descriptions of new hardware, software, interfacing ideas, prototypes, training programs, job opportunities, volunteer usage, user evaluations, educational opportunities ...
openaire +1 more source
A monthly section highlighting the impact of technological development on consumers and the blindness/visual impairment field. We need your support. Please send news, reviews, and descriptions of new hardware, software, interfacing ideas, prototypes, training programs, job opportunities, volunteer usage, user evaluations, educational opportunities ...
openaire +1 more source
Improving the access time for random access files
Communications of the ACM, 1977Clustering in the key set is decreased by smoothing the key-to-address transformation, and by adding shadow buckets to an open chaining file. The keys are pre-hashed before the address division, to remove the effect of sequential properties in the key set. Shadow buckets in the key search sequence reduce the effect of nonuniformity in file loading, and
openaire +3 more sources
Deep Dyna-Reinforcement Learning Based on Random Access Control in LEO Satellite IoT Networks
IEEE Internet of Things Journal, 2022Keping Long +2 more
exaly
On the power of random access machines
1979We study the power of deterministic successor RAM's with extra instructions like +,*,⋎ and the associated classes of problems decidable in polynomial time. Our main results are NP ... PTIME (+,*,⋎) and PTIME(+,*) ... RP, where RP denotes the class of problems randomly decidable (by probabilistic TM's) in polynomial time.
openaire +2 more sources
Grant-Free Random Access in Machine-Type Communication: Approaches and Challenges
IEEE Wireless Communications, 2022Zhiguo Ding, Jie Ding, Jinho Choi
exaly
Recycling Random Access Opportunities with Secondary Access Class Barring
IEEE Transactions on Mobile Computing, 2020Yunmin Kim, Yijun Piao, Tae-Jin Lee
exaly
In-Memory Logic Operations and Neuromorphic Computing in Non-Volatile Random Access Memory
Materials, 2020Lei Wang, Jing Wen, Yi Tong
exaly