Results 11 to 20 of about 2,361 (188)
Hardware acceleration of number theoretic transform for zk‐SNARK
Engineering Reports, EarlyView., 2023 An FPGA‐based hardware accelerator with a multi‐level pipeline is designed to support the large‐bitwidth and large‐scale NTT tasks in zk‐SNARK. It can be flexibly scaled to different scales of FPGAs and has been equipped in the heterogeneous acceleration system with the help of HLS and OpenCL.
Haixu Zhao +6 more
wiley +1 more source
Approximate analysis of non-stationary loss queues and networks of loss queues with general service time distributions [PDF]
, 2011 A Fixed Point Approximation (FPA) method has recently been suggested for non-stationary analysis of loss queues and networks of loss queues with Exponential service times.
Worthington, D. J. +7 more
core +1 more source
Appointment capacity planning in specialty clinics: a queueing approach [PDF]
, 2015 Specialty clinics provide specialized care for patients referred by primary care physicians, emergency departments, or other specialists. Urgent patients must often be seen on the referral day, whereas nonurgent referrals are typically booked an ...
Izady, N., Izady, Navid
core +1 more source
Synonym‐based multi‐keyword ranked search with secure k‐NN in 6G network
IET Networks, EarlyView., 2022 Abstract Sixth Generation (6G) integrates the next generation communication systems such as maritime, terrestrial, and aerial to offer robust network and massive device connectivity with ultra‐low latency requirement. The cutting edge technologies such as artificial intelligence, quantum machine learning, and millimetre enable hyper‐connectivity to ...
Deebak Bakkiam David, Fadi Al‐Turjman
wiley +1 more source
Distributed wireless network resource optimisation method based on mobile edge computing
IET Networks, EarlyView., 2022 This paper mainly compares the network ranking leader, consumption amount and network signal reception of the three algorithms. The study found that in terms of network sort captain, there are significant differences between the CPLEX algorithm, the CCST algorithm, and edge computing methods. The CCST algorithm and edge computing have little difference
Jiongting Jiang +4 more
wiley +1 more source
Setting staffing requirements for time-dependent queueing networks: the case of accident and emergency departments [PDF]
, 2012 An incentive scheme aimed at reducing patients’ waiting times in accident and emergency departments was introduced by the UK government in 2000. It requires 98% of patients to be discharged, transferred, or admitted to inpatient care within 4 hours of ...
Dave Worthington +6 more
core +1 more source
Tail asymptotics for processor sharing queues [PDF]
, 2003 The basic queueing system considered in this paper is the M/G/1 processor-sharing queue with or without impatience and with finite or infinite capacity.
Zwart, A.P. +8 more
core +1 more source
Priority Auctions and Queue Disciplines that Depend on Processing Time [PDF]
, 2004 Lecture on the first SFB/TR 15 meeting, Gummersbach, July, 18 - 20, 2004We analyze the allocation of priority in queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing ...
Kittsteiner, Thomas, Moldovanu, Benny
core +2 more sources
Interacting queues in heavy traffic [PDF]
, 2010 We consider a system of parallel queues with Poisson arrivals and exponentially distributed service requirements. The various queues are coupled through their service rates, causing a complex dynamic interaction.
Morrison, J.A. +6 more
core +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT This study demonstrates how a profitable, lean, and environmentally responsible e‐waste reverse logistics system can be designed using integrated Operations Research (OR) techniques. Addressing the growing urgency of responsible consumption (UN SDG 12) and the projected rise of the e‐waste sector to USD 137.60 billion by 2029, the research ...
Sheeba Pathak, Hajar Fatorachian
wiley +1 more source