.png){kind=icon}
返回
A heuristic method for reactive power planning
.png){kind=icon}
PRE
AI
DOI：10.1109/59.485987.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An approach for solving reactive power planning problems is presented, which is based on binary search techniques and the use of a special heuristic to obtain a discrete solution. Two versions were developed, one to run on conventional (sequential) computers and the other to run on a distributed memory (hypercube) machine. This latter parallel processing version employs an asynchronous programming model. Once the set of candidate buses has been defined, the program gives the location and size of the reactive sources needed(if any) in keeping with operating and security constraints.
Keyword:
reactive power planning
parallel processing
binary search
heuristic methods
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
暂无机构信息
引用论文
Replacing Soybean Meal with Urea in Diets for Heavy Fattening Lambs: Effects on Growth, Metabolic Profile and Meat Quality.png)
Animals
OAAI
AnimalsIF0
OAAI分享收藏The effects of item familiarity on the neural correlates of successful associative memory encodingOAAI
OAAI分享收藏
查看更多内容