نتایج جستجو برای: competitive algorithm
تعداد نتایج: 833013 فیلتر نتایج به سال:
It is shown that the work function algorithm for the 2-evader problem has competitive ratio m ? 2 for all metric spaces with m points. This settles the k-server conjecture for metric spaces with k+2 points.
Due to the exponential growth of electronic texts, their organization and management requires a tool to provide information and data in search of users in the shortest possible time. Thus, classification methods have become very important in recent years. In natural language processing and especially text processing, one of the most basic tasks is automatic text classification. Moreover, text ...
periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. this paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (pvrp). the related results of proposed algorithm are compared with the resu...
In this paper, the investment portfolio is formed based on the data mining algorithm of CHAID on the basis of the risk status criteria. In the next step, the second investment portfolio is created based on the decision rules extracted by the DEA-BCC model. The final portfolio is created through a two-objective mathematical programming model based on the Imperialist Competitive algorithm.
in today's design, system complexity and increasing demand for safer, more efficient and less costly systems have created new challenges in science and engineering. locomotives are products which are designed according to market order and technical needs of customers. accordingly, targets of companies, especially designers and manufacturers of locomotives, have always been on the path of progre...
with the rapid development of the internet, the amount of information and data which are produced, are extremely massive. hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. data mining can overcome this problem. while data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. as the speed of ...
the traveling salesman problem (tsp) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. the tsp is probably the most famous and extensively studied problem in the field of combinatorial optimization. because this problem is an np-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
in this paper, we present a new method to determine the optimal location and parameter settings of unifiedpower flow controller (upfc) for removing voltage violations and transmission lines overloading. upfc isconsidered as the most powerful member of the facts devices, that it can control shunt and series power flow.this option gives to upfc the power to control the voltage profile and transmi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید