network planning algorithmcovering location problemheterogeneous infrastructuressmart gridFocus of this paper is the evaluation and opti- mization of automatic network planning algorithms considering different communication technologies supporting Smart Grid communication infrastructures. Therefore, a performanc...
We show that in the equal-budgets case, PACE is equivalent to the integral greedy algorithm. We go on to show that with natural restrictions on the adversarial input model, both integral greedy allocation and PACE have asymptotically bounded multiplicative envy as well as competitive ratio for ...
Compared with fast sorting technique and improving fast sorting technique, the algorithmic complexity of PGCST is independent of system size and it has higher algorithm efficiency. When applied into power system risk assessment, case study in RBTS and RTS79 illustrate that PGCST has high evaluation...
In this paper, we propose Gateway Node-Based Greedy Routing (GNGR), a reliable greedy position-based routing approach algorithm. In GNGR, we forward the packets to any of the nodes in the corner of the transmission range of source/forwarding node as most suitable next hop. With this ...
6. Adaptive MANET Multipath Routing Algorithm Based on the Simulated Annealing Approach [O] . Sungwook Kim -1 机译:基于模拟退火方法的自适应MANET多径路由算法 7. Energy Efficient Routing with MAX-Min Energy Scheme in Ad-hoc On-Demand Multipath Distance Vector routing for MANET [O] . Har...
The notion of using a meta-heuristic approach to solve the Knapsack Problem has been intensively studied in recent years. By comparing and analyzing the research of Ant Colony Algorithm (AVA) for 0/1 Knapsack Problem the authors propose an improved ACA b
In this paper, a greedy and A-based searching algorithm is proposed to find the optimal morphological filter on binary images. According to the Matheron representation, the estimator for mean square error (MSE) is defined as the union of multiple erosions. Unfortunately, finding the optimal solu...
We present an effective algorithm named as greedy code search based memetic algorithm (MA-GCS) to design such code sets. MA-GCS is a novel variation of the new evolutionary search, which can be used to design only a single binary sequence with low autocorrelation peaks. MA-GCS integrates an...
sensors Article A Heuristic-Based Adaptive Iterated Greedy Algorithm for Lot-Streaming Hybrid Flow Shop Scheduling Problem with Consistent and Intermingled Sub-Lots Yiling Lu 1,2, Qiuhua Tang 1,2,*, Quanke Pan 3, Lianpeng Zhao 1,2 and Yingying Zhu 1,2 1 Key Laboratory of Metallurgical ...
翻译结果1复制译文编辑译文朗读译文返回顶部 This article is based compression perception reconstruction used a greedy algorithm - matching pursuit constructed light source reconstruction algorithm, the algorithm by simulation experiments to validate and assess the feasibility in the the blt application in ...