Let G = (V,E) (|V | = n and |E| = m) be an undirected graph with positive edge weights. Let PG(s, t) be a shortest s− t path in G. Let l be the number of edges in PG(s, t). The Edge Replacement Path problem is to compute a shortest s− t path in G\{e}, for every edge e in PG(s, t). The Node Replacement Path problem is to compute a shortest s− t path in G\{v}, for every vertex v in PG(s, t). In t...

The product replacement algorithm is a heuristic designed to generate random group elements. The idea is to run a random walk on generating k-tuples of the group, and then output a random component. The algorithm was designed by Leedham-Green and Soicher ([31]), and further investigated in [12]. It was found to have an outstanding performance, much better than the the previously known algorithm...

Memory hierarchy is used to compete the processors speed. Cache memory is the fast memory which is used to conduit the speed difference of memory and processor. The access patterns of Level 1 cache (L1) and Level 2 cache (L2) are different, when CPU not gets the desired data in L1 then it accesses L2. Thus the replacement algorithm which works efficiently on L1 may not be as efficient on L2. Si...

In this paper we survey several aspects related to normal forms of hyperedge replacement grammars. Considering context free hyperedge replacement grammars we introduce, inspired by string grammars, Chomsky Normal Form and Greibach Normal Form. The algorithm of conversion is quite the same with the algorithm for string grammars. The important difference is related to the fact that hyperedge gram...

A cache replacement algorithm called probability based replacement (PBR) is proposed in this paper. The algorithm makes replacement decision based on the byte access probabilities of documents. This concept can be applied to both small conventional web documents and large video documents. The performance of PBR algorithm is studied by both analysis and simulation. By comparing cache hit probabi...

This paper proposes a genetic algorithm based on a new replacement strategy to solve the quadratic assignment problems, which are NP-hard. The new replacement strategy aims to improve the performance of the genetic algorithm through well balancing the convergence of the searching process and the diversity of the population. In order to test the performance of the algorithm, the instances in QAP...

In this paper, an effective probability-based tile pre-fetching algorithm and a collaborative cache replacement algorithm for Web geographical information systems(Web GISs) are proposed. The proposed tile pre-fetching algorithm can approximate which tiles will be used in advance based on the global tile access pattern of all users and the semantics of query so that a user request will be answer...

The requirement of varying doses of warfarin for different individuals can be explained by environmental and genetic factors. We evaluated the frequency of vitamin K epoxide reductase complex subunit 1 (VKORC1) and cytochrome P450 2C9 (CYP2C9) variants together with patientdemographic characteristics and investigated their association with warfarin dose requirement with the ob...

The requirement of varying doses of warfarin for different individuals can be explained by environmental and genetic factors. We evaluated the frequency of vitamin K epoxide reductase complex subunit 1 (VKORC1) and cytochrome P450 2C9 (CYP2C9) variants together with patientdemographic characteristics and investigated their association with warfarin dose requirement with the ob...

Cache memories help bridge the cycle-time gap between fast microprocessors and relatively slow main memories. By holding recently referenced regions of memory, caches can reduce the number of cycles the processor must stall while waiting for data. As the disparity between processor and main memory cycle times increases by 40 percent or more per year cache performance becomes ever more critical....