نتایج جستجو برای: optimal switch placement

تعداد نتایج: 492654  

The most costly operation in the oil exploration is the well network drilling. One of the most effective ways to reduce the cost of drilling networks is decreasing the number of the required wells by selecting the optimum situation of the rig placement. In this paper, Balas algorithm is used as a model for optimizing the cost function in oil well network, where the vertical and directional dril...

1998
Suresh Subramaniam Murat Azizoglu Arun K. Somani

In this paper, we consider the problem of optimally placing a given number of wavelength converters on a path to minimize the call blocking probability. Using a simple performance model, we first prove that uniform spacing of converters is optimal for the end-to-end performance when link loads are uniform and statistically independent. We then show that significant gains are achievable with opt...

2003
Anxiao Jiang Jehoshua Bruck

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...

2008
A. Lakshmi Devi B. Subramanyam

Distributed generators are beneficial in reducing the losses effectively compared to other methods of loss reduction. In this paper optimal DG unit placement using fuzzy logic is discussed. The optimal size of the DG unit is calculated analytically using approximate reasoning suitable nodes are determined for DG unit placement. Voltage and power loss reduction indices of distribution system nod...

Journal: :Computers & Electrical Engineering 2010
Farshad Rostamabadi Mohammad Ghodsi

Please cite this article in press as: Rostam (2008), doi:10.1016/j.compeleceng.2008 We consider an incremental optimal label placement in a closed-2PM map containing points each attached with a label. Labels are assumed to be axis-parallel square-shaped and have to be pairwise disjoint with maximum possible length each attached to its corresponding point on one of its horizontal edges. Such a l...

Journal: :Energy Reports 2021

Distribution utilities aim to operate and plan their network in a secure economical way. The prime focus of this work is assist by developing new integrated approach which considers the impacts system reliability distribution planning (DSP). This merges different problems together solves them two-stage process, as follows: 1. cable routing optimal location number switching devices (circuit brea...

Journal: :international journal of robotics 0
mohammad hasan ghasemi babol university of technology mohammad jafar sadigh isfahan university of technology

the large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. most of this computational burden is due to calculation of switching points. in this paper a learning algorithm is proposed for finding the switching points. the method, which can be used for both ...

Journal: :International Transactions on Electrical Energy Systems 2022

Improving reliability is one of the most critical problems in power distribution networks. Optimal placement automatic switches improves system reliability. Practical constraints such as maneuver points and capacity neighboring feeders are often overlooked. Reliability indices may also be improved by optimizing point locations considering capacities feeders. In this paper, a new perspective on ...

2003
Anxiao Jiang Jehoshua Bruck

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...

Journal: :J. Algorithms 1998
Vincenzo Auletta Mimmo Parente Giuseppe Persiano

We consider the problem of placing k identical resources in a graph where each vertex is associated with a nonnegative weight representing the frequency of requests issued by that vertex for the resource. We de ne the cost of a placement as the sum over all vertices of their distances to the closest resource weighted by their weights. The optimal placement is the placement with least cost among...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید