Search - Placement Algorithm

Search - Placement Algorithm - List

[WEB Code] An_Efficient_and_Effective_Detailed_Placement_Algo DL : 0: An Efficient and Effective Detailed Placement Algorithm Global Swap  To identify a pair of cells that can be swapped to reduce wirelength (others are fixed). 2. Vertical Swap  Swap a cell with a nearby cell in the segment above or below. 3. Local Re-ordering  Re-order consecutive cells locally to reduce wirelength. 4. Single-Segment Clustering  Place cells optimally within a segment.
Update : 2008-10-13 Size : 26.62kb Publisher : Hsieh
[Documents] An_Efficient_and_Effective_Detailed_Placement_Algo DL : 0: An Efficient and Effective Detailed Placement Algorithm Global Swap  To identify a pair of cells that can be swapped to reduce wirelength (others are fixed). 2. Vertical Swap  Swap a cell with a nearby cell in the segment above or below. 3. Local Re-ordering  Re-order consecutive cells locally to reduce wirelength. 4. Single-Segment Clustering  Place cells optimally within a segment.
Update : 2025-03-07 Size : 26kb Publisher : Hsieh
[AI-NN-PR] 11212 DL : 0: 基于神经网络的自动布局算基于神经网络的自动布局算-a pcb automatic placement algorithm based on neural networks
Update : 2025-03-07 Size : 115kb Publisher : ilppgo
[Internet-Network] Gateway_Placement_Optimization_in_Wireless DL : 0: In a Wireless Mesh Network (WMN), the traffic is aggregated and forwarded towards the gateways. Strategically placing and connecting the gateways to the wired backbone is critical to the management and efficient operation of a WMN. In this paper, we address the problem of gateways placement, consisting in placing a minimum number of gateways such that QoS requirements are satisfied. We propose a polynomial time near-optimal algorithm which recursively computes minimum weighted Dominating Sets (DS), while consistently preserving QoS requirements across iterations. We evaluate the performance of our algorithm using both analysis and simulation, and show that it outperforms other alternative schemes by comparing the number of gateways placed in different scenarios. -In a Wireless Mesh Network (WMN), the traffic is aggregated and forwarded towards the gateways. Strategically placing and connecting the gateways to the wired backbone is critical to the management and efficient operation of a WMN. In this paper, we address the problem of gateways placement, consisting in placing a minimum number of gateways such that QoS requirements are satisfied. We propose a polynomial time near-optimal algorithm which recursively computes minimum weighted Dominating Sets (DS), while consistently preserving QoS requirements across iterations. We evaluate the performance of our algorithm using both analysis and simulation, and show that it outperforms other alternative schemes by comparing the number of gateways placed in different scenarios.
Update : 2025-03-07 Size : 235kb Publisher : Dinh Huu Nghia
[Windows Develop] Kinesis-a-placement-approach DL : 0: 本文给出了分布式存储系统中副本放置的一个算法kinesis，大大提高了系统的负载均衡-In this paper, a copy of the distributed storage system placed on an algorithm kinesis, greatly improving the load balance
Update : 2025-03-07 Size : 611kb Publisher : Joey
[Mathimatics-Numerical algorithms] ealin DL : 0: 统一关键路径时延为基准FPGA模拟退火布局算法-Unified critical path delay as the benchmark simulated annealing FPGA placement algorithm
Update : 2025-03-07 Size : 337kb Publisher : xin
[matlab] DG_PSO_P_33 DL : 1: dg placement by pso algorithm
Update : 2025-03-07 Size : 1kb Publisher : javad
[Other] GUI DL : 0: 线性系统仿真，能控性，能观性及零极点配置算法，LQR算法-Linear system simulation, controllability, observability and zero-pole placement algorithm, LQR algorithm
Update : 2025-03-07 Size : 1.27mb Publisher : 马志强
[Other] wsn DL : 0: 一种随机分布WSN中多sink节点放置算法-A random distribution of WSN in multi sink node placement algorithm
Update : 2025-03-07 Size : 100kb Publisher : kobe
[Algorithm] Fusion-based-Sensor-Placement DL : 0: 论文　在使用无线传感器网络进行目标检测时,如何布置尽可能少的传感器节点而同时实现高的正确检测概率和低的误警率,是关键问题之一。采用数据融合技术,能实现传感器节点之间的协同,从而大幅提高目标检测精度。提出了用于目标检测的精度模型,分析了数据融合半径与传感器节点密度之间的关系,设计聚类方法将目标点组织成布置单元,从高密度单元到低密度单元布置传感器节点覆盖目标区域。仿真结果表明,算法在保证检测精度的同时能有效减少所使用的传感器节点数目。 - Sensor placement is a key issue in target detection,placing smaller sensors to achieve high detection accuracy which presented as a specific high detection probability and a low false alarm rate is very important.Data fusion based collaboration between sensors can boost the level of accuracy in general.In this paper,the accuracy model and the rela- tionship between the fusion radius and density of sensors were analyzed a quality-threshold clustering algorithm was employed to organize the surveillance locations into placement units,place sensors in them from the intensive to sparse one.Simulation results show that this placement algorithm can significantly reduce the total number of sensors with guaranteed accuracy.
Update : 2025-03-07 Size : 233kb Publisher : 子木
[Windows Develop] 1 DL : 0: a genetic algorithm based dg placement algorithm-a genetic algorithm based dg placement algorithm
Update : 2025-03-07 Size : 337kb Publisher : peddu
[Other] OPTIMAL-CAPACITOR-PLACEMENT DL : 0: this program is optimal capasitor plasement with PSO algorithm.
Update : 2025-03-07 Size : 2kb Publisher : afroozi
[File Format] Applying-BCO-Algorithm-to-Solve DL : 1: Applying BCO Algorithm to Solve the Optimal DG Placement and Sizing Problem
Update : 2025-03-07 Size : 279kb Publisher : esfand
[File Format] Replica-Placement-Algorithm DL : 0: 针对分布式媒体服务系统中的副本放置问题，从优化节点间的传输代价出发，提出一种基于全局信息的启发式副本放置算法—— Zero2min，与现有算法相比，节省传输代价10 ~36 。根据Zero2min 算法的思路，给出媒体内容逐渐增加情况下的一种动态放置方法，仿真结果表明，其代价小于Max2min。-Aiming at the problem of replica placement in a distributed media system to reduce the cost of transferring data among nodes, this paper proposes an heuristic replica placement algorithm——Zero2min based on global information, compared with common algorithm, its cost is reduced by 10 ~36 . It further proposes a method to place the media data when the data is imported into the system. Simulation results show that its cost is less than Max2min.
Update : 2025-03-07 Size : 1.16mb Publisher : compiler
[Industry research] sensitivity-based-capacitor-placement-using-cucko DL : 0: sensitivity based capacitor placement using cuckoo search algorithm for maximum annual savings
Update : 2025-03-07 Size : 274kb Publisher : john
[Industry research] capacitor-placement-using-bat-algorithm-for-annua DL : 0: capacitor placement using bat algorithm for annual savings
Update : 2025-03-07 Size : 316kb Publisher : john
[matlab] FACTS-PLACEMENT DL : 1: FACTS Placement In Distribution Networks Using Cuckoo Search Algorithm
Update : 2025-03-07 Size : 14kb Publisher : mmee83@gmail.com
[matlab] 3_DGPlaceOptimImperiCompAlgo DL : 0: DG Placement optimization in 33-bus and 69-bus distribution power systems using Imperialistic Competition optimization algorithm.
Update : 2025-03-07 Size : 51kb Publisher : arman9069
[matlab] 109201289dg-placement DL : 0: This paper presents a new method to solve the network reconfiguration problem in the presence of distributed generation (DG) with an objective of minimizing real power loss and improving voltage profile in distribution system. A meta heuristic Harmony Search Algorithm (HSA) is used to simultaneously reconfigure and identify the optimal locations for installation of DG units in a distribution network. Sensitivity analysis is used to identify optimal locations for installation of DG units. Different scenarios of DG placement and reconfiguration of network are considered to study the performance of the proposed method. The constraints of voltage and branch current carrying capacity are included in the uation of the objective function. The method has been tested on 33-bus and 69-bus radial distribution systems at three different load levels to demonstrate the performance and effectiveness of the proposed method. The results obtained are encouraging. (2014-11-17
Update : 2025-03-07 Size : 57kb Publisher : salameh
[Documents] X AMINE_160224_3 DL : 0: base station placement using genetic algorithm
Update : 2025-03-07 Size : 550kb Publisher : aminos

« 12 3 4 »