نتایج جستجو برای: replacement algorithm
تعداد نتایج: 861660 فیلتر نتایج به سال:
In this article, we propose a new evolutionary algorithm, referred as homologous Gene Replacement Genetic Algorithm (hGRGA) that includes a novel and generic operator called homologous Gene Replacement (hGR). The hGR operator improves the chromosomes in gene level to promote their overall functionality. The hGRGA effectively encodes the key idea of the natural evolutionary process that locates ...
In this paper, a low order recursive linear prediction method and recursive least square as an adaptive filter (LP-RLS) are introduced to predict the speech and the excitation signals. In real-time packet-based communication systems, one major problem is misrouted or delayed packets which results in degraded perceived voice quality. If packets are not available on time, the packet is known as l...
Multimedia object caching, by which the same multimedia object can be adapted to diverse mobile appliances through the technique of transcoding, is an important technology for improving the scalability of web services, especially in the environment of mobile networks. In this paper, we address the problem of cache replacement for multimedia object caching by exploring the minimal access cost of...
This paper explores the aggregate effect when caching multiple versions of the same Web object in the transcoding proxy. Explicitly, the aggregate profit from caching multiple versions of an object is not simply the sum of the profits from caching individual versions, but rather, depends on the transcoding relationships among them. Hence, to evaluate the profit from caching each version of an o...
The MIN algorithm is an offline strategy for deciding which item to replace when writing a new item to a cache. Its optimality was first established byMattson, Gecsei, Slutz, and Traiger [2] through a lengthy analysis. We provide a short and elementary proof based on a dynamic programming argument.
This paper introduces a new approach to database disk buffering, called the LFU-K method. The LFU-K page replacement algorithm is an improvement to the Least Frequently Used (LFU) algorithm. The paper proposes a theoretical-probability model for formal description of LFU-K algorithm. Using this model we evaluate estimations for the LFU-K parameters. This paper also describes an implementation o...
This paper reports our research results that improve second level bu er cache performance. Several previous studies have shown that a good single level cache replacement algorithm such as LRU does not work well with second level bu er caches. Second level bu er caches have di erent access pattern from rst level bu er caches because Accesses to second level bu er caches are actually misses from ...
prosthetic joint infection (pji) is a calamitous complication with high morbidity and substantial cost. the reported incidence is low but it is probably underestimated due to the difficulty in diagnosis. pji has challenged the orthopaedic community for several years and despite all the advances in this field, it is still a real concern with immense impact on patients, and the healthcare system....
Premature clotting of the circuit is the most common reason for unplanned interruptions in renal replacement therapy (RRT) and discrepancies between the prescribed and delivered dose of RRT [1]. The recent guideline from the Kidney Disease Improving Global Outcomes (KDIGO) working group recommended citrate as the first-line anticoagulant for continuous renal replacement therapy (CRRT) [2]. For ...
Abstract. Hard disks, most prevalent mass-storage devices, have high power consumption and high response time for random I/O requests. Recent remarkable technology improvement of flash memory has made it a rising secondary storage device but flash memory still has high cost per bit. Usage of heterogeneous storage devices such as a pair of a hard disk and a flash memory can provide reasonable co...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید