Results 231 to 240 of about 34,561 (298)
Implant‑position reproducibility of wired and wireless intraoral scanners and the effects of Wi‑Fi distance and upload speed: an in vitro study. [PDF]
BMC Oral HealthMurakami T +7 more
europepmc +1 more source
A flow-level dataset of WireGuard tunnel traffic with matched encrypted-side features and application labels. [PDF]
Data BriefRazooqi YS, Pekar A.
europepmc +1 more source
Fault tolerant and quality of service aware routing algorithm based on priority technique for scalable network on chip architectures. [PDF]
Sci RepYu X, Tang L, Mi J, Liu J, Long L.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE Transactions on Computers, 1994
The Chaos router, a randomizing, nonminimal adaptive packet router is introduced. Adaptive routers allow messages to dynamically select paths, depending on network traffic, and bypass congested nodes. This flexibility contrasts with oblivious packet routers where the path of a packet is statically determined at the source node. A key advancement of the
Smaragda Konstantinidou +1 more
openaire +1 more source
The Chaos router, a randomizing, nonminimal adaptive packet router is introduced. Adaptive routers allow messages to dynamically select paths, depending on network traffic, and bypass congested nodes. This flexibility contrasts with oblivious packet routers where the path of a packet is statically determined at the source node. A key advancement of the
Smaragda Konstantinidou +1 more
openaire +1 more source
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
A permeation routing algorithm is proposed which decides the detailed routes on a new layout model. The permeation router attains a higher density by using the expanded routing region as well as the conventional one simultaneously. This routing algorithm consists of two phases.
Yoichi Shiraishi, Jun'ya Sakemi
openaire +2 more sources
A permeation routing algorithm is proposed which decides the detailed routes on a new layout model. The permeation router attains a higher density by using the expanded routing region as well as the conventional one simultaneously. This routing algorithm consists of two phases.
Yoichi Shiraishi, Jun'ya Sakemi
openaire +2 more sources
2011 20th European Conference on Circuit Theory and Design (ECCTD), 2011
Peer ...
Ahmet Unutulmaz +2 more
openaire +2 more sources
Peer ...
Ahmet Unutulmaz +2 more
openaire +2 more sources
Proceedings of the 44th Annual IEEE/ACM International Symposium on Microarchitecture, 2011
Power efficient, low latency interconnects are increasingly important in a computing era dominated by growing core counts and diminishing power budgets. This paper proposes the use of a novel coding-based crossbar architecture to perform packet arbitration in parallel with switch traversal.
Mitchell Hayenga, Mikko H. Lipasti
openaire +1 more source
Power efficient, low latency interconnects are increasingly important in a computing era dominated by growing core counts and diminishing power budgets. This paper proposes the use of a novel coding-based crossbar architecture to perform packet arbitration in parallel with switch traversal.
Mitchell Hayenga, Mikko H. Lipasti
openaire +1 more source
Proceedings of the nineteenth design automation conference on - DAC '82, 1982
Abstract A ‘greedy’ channel-router is presented. It is quick, simple and effective. It always suceeds, usually using no more than one track more than required by channel density. It may be forced in rare cases to make a few connections ‘off the end’ of the channel, in order to succeed.
Ronald L. Rivest, Charles M. Fiduccia
openaire +2 more sources
Abstract A ‘greedy’ channel-router is presented. It is quick, simple and effective. It always suceeds, usually using no more than one track more than required by channel density. It may be forced in rare cases to make a few connections ‘off the end’ of the channel, in order to succeed.
Ronald L. Rivest, Charles M. Fiduccia
openaire +2 more sources
Journal of Parallel and Distributed Computing, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Valentin Puente +5 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Valentin Puente +5 more
openaire +3 more sources