This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the file placement problem, and therefore give only sub-optimal solutions. A dynamic programming algorithm of low complexity which computes the optimal solution is presented. It is shown both analytically and experimentally t...

A key assumption of all problem-solving approaches based on utility theory, including heuristic search, is that we can assign a utility or cost to each state. This in turn requires that all criteria of interest can be reduced to a common ratio scale. However, many real-world problems are difficult or impossible to formulate in terms of minimising a single criterion, and it is often more natural...

To identify the optimal route is a complex task in packet switched network because optimization depends upon a number of parameters. In this paper Genetic Algorithm is used to locate the optimal route. Genetic Algorithm starts with a number of solutions where each solution is represented in the form of chromosome using the permutation encoding scheme. The success of Genetic Algorithm depends up...

This review concentrates on the various chemical routes for synthesis of silver nanowires by soft solution methods, and also the production of gold nanotubes and Pt nanotubes from different templates. After a comprehensive comparison between the developed methods, it is concluded that the soft solution method has obvious advantages and is the most promising route for the mass production of silv...

CHEST, 70: 4, OCTOBER, 1976 if a 1-percent solution is adequate. We use 5 ml of a 4percent solution of lidocaine (for a total of 200 mg) to anesthetize the larynx and tracheobronchial tree. We have now performed over 4,500 examinations with the fiberoptic bronchoscope using the oral route of intubation and have encountered no episodes of serious laryngospasm.2 More importantly, we premedicate a...

Abstract. The Orienteering Problem with Time Windows (OPTW) is a well-known routing problem in which a given positive profit and time interval are associated with each location. The solution to the OPTW finds a route comprising a subset of the locations, with a fixed limit on length or travel time, that maximises the cumulative score of the locations visited in the predefined time intervals. Th...

A key assumption of all problem-solving approaches based on utility theory is that we can assign a utility or cost to each state. This in turn requires that all criteria of interest can be reduced to a common ratio scale. However, many realworld problems are difficult or impossible to formulate in terms of minimising a single criterion, and it is often more natural to express problem requiremen...

For the cloud database route scheduling problem, this paper designed a cloud database route scheduling algorithm according to the dynamic combination of the genetic algorithm and ant colony algorithm. The initial solution got by the Genetic Algorithm was transformed into the pheromone initial value, which was needed by ant colony algorithm, then the optimal solution by the ant colony algorithm ...

We consider the problem of designing lines in a public transport system, where we include user-optimal route choice. The model we develop ensures that there is enough capacity present for every passenger to travel on a shortest route. We present two different integer programming formulations for this problem, and discuss exact solution approaches. To solve large-scale line planning instances, w...

Here, 6 different ultrathin (<5 nm) 2D metal oxides and hydroxides have been successfully synthesized via a simple precipitation route in formamide aqueous solution at room temperature.