咨询与建议

限定检索结果

文献类型

  • 10 篇 会议
  • 5 篇 期刊文献

馆藏范围

  • 15 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 13 篇 工学
    • 4 篇 电气工程
    • 4 篇 计算机科学与技术...
    • 3 篇 信息与通信工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 机械工程
    • 1 篇 仪器科学与技术
    • 1 篇 动力工程及工程热...
    • 1 篇 电子科学与技术(可...
    • 1 篇 石油与天然气工程
    • 1 篇 航空宇航科学与技...
    • 1 篇 核科学与技术
    • 1 篇 软件工程
  • 2 篇 理学
    • 1 篇 数学
    • 1 篇 系统科学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 15 篇 spanning tree al...
  • 2 篇 kruskal
  • 2 篇 minimal
  • 2 篇 spanning tree
  • 1 篇 stream computing
  • 1 篇 distributed syst...
  • 1 篇 valid
  • 1 篇 boundary element...
  • 1 篇 setting coordina...
  • 1 篇 runtime
  • 1 篇 parallel process...
  • 1 篇 power grids
  • 1 篇 descriptors
  • 1 篇 message passing
  • 1 篇 parallel efficie...
  • 1 篇 document assembl...
  • 1 篇 bridges
  • 1 篇 flight strip
  • 1 篇 NOT FOUND
  • 1 篇 prim’s

机构

  • 1 篇 univ maryland de...
  • 1 篇 school of comput...
  • 1 篇 itri comp & comm...
  • 1 篇 clemson univ dep...
  • 1 篇 school of traffi...
  • 1 篇 hokkaido univ fa...
  • 1 篇 univ augsburg d-...
  • 1 篇 univ maryland ae...
  • 1 篇 dept. of eecs no...
  • 1 篇 florida state un...
  • 1 篇 univ tsukuba fac...
  • 1 篇 department of co...
  • 1 篇 cinvestav-guadal...
  • 1 篇 univ oregon dept...
  • 1 篇 kwangwoon univ d...
  • 1 篇 univ maryland ae...
  • 1 篇 computer science...
  • 1 篇 department of el...
  • 1 篇 geac computers c...
  • 1 篇 korea univ dept ...

作者

  • 1 篇 lee hojun
  • 1 篇 emmanuel asani
  • 1 篇 jung yoongun
  • 1 篇 joyce ayoola
  • 1 篇 chiba g
  • 1 篇 peace ayegba
  • 1 篇 jang gilsoo
  • 1 篇 han changhee
  • 1 篇 dan pelleg
  • 1 篇 cartes d. a.
  • 1 篇 ries christian x...
  • 1 篇 kang sungwoo
  • 1 篇 song sungyoon
  • 1 篇 tsuji m
  • 1 篇 朱松年
  • 1 篇 cheston ga
  • 1 篇 juan m. ramirez
  • 1 篇 richter fabian
  • 1 篇 aderemi okeyinka
  • 1 篇 andrew moore

语言

  • 14 篇 英文
  • 1 篇 其他
检索条件"主题词=spanning tree algorithm"
15 条 记 录,以下是1-10 订阅
HOT-SPOT spanning tree algorithm FOR A BRIDGED LAN/MAN
收藏 引用
COMPUTER COMMUNICATIONS 1995年 第5期18卷 357-366页
作者: HUANG, NF MA, GK WU, YJ ITRI COMP & COMMUN RES LABSCTR ADV TECHNOLHSINCHU 310TAIWAN
A bridged local area network (BLAN) is an internetwork where a lot of LANs and MANs are interconnected via bridges. The active spanning tree topology of a BLAN is to ensure that one and only one active routing path ex... 详细信息
来源: 评论
A minimal spanning tree algorithm for distribution networks configuration
A minimal spanning tree algorithm for distribution networks ...
收藏 引用
IEEE Power and Energy Society General Meeting
作者: Diana P. Montoya Juan M. Ramirez Department of Electrical Power System CINVESTAV-Guadalajara CINVESTAV-Guadalajara. MEXICO
A minimal spanning tree algorithm for distribution networks configurations is proposed. The paper approaches the formulation by the power losses' minimization in order to select a new configuration, keeping a radi... 详细信息
来源: 评论
An Efficient Minimum spanning tree algorithm
An Efficient Minimum Spanning Tree Algorithm
收藏 引用
IEEE Symposium on Computers and Communications
作者: Abdullah-Al Mamun Sanguthevar Rajasekaran Computer Science and Engineering University of Connecticut USA
Finding minimum spanning trees (MST) in various types of networks is a well-studied problem in theory and practical applications. A number of efficient algorithms have been already developed for this problem. In this ... 详细信息
来源: 评论
Parallelism Extraction algorithm from Stream-based Processing Flow applying spanning tree  28
Parallelism Extraction Algorithm from Stream-based Processin...
收藏 引用
28th IEEE International Parallel & Distributed Processing Symposium Workshops (IPDPSW)
作者: Wang, Guyue Yamagiwa, Shinichi Wada, Koichi Univ Tsukuba Fac Engn Informat & Syst Dept Comp Sci Tsukuba Ibaraki Japan
Manycore architecture promotes a massively parallel computing on the accelerators. Especially GPU is one of the main series of the high performance computing, which is also employed by top supercomputers in the world.... 详细信息
来源: 评论
A Comparative Study Of Minimal spanning tree algorithms
A Comparative Study Of Minimal Spanning Tree Algorithms
收藏 引用
Mathematics, Computer Engineering and Computer Science (ICMCECS), International Conference in
作者: Peace Ayegba Joyce Ayoola Emmanuel Asani Aderemi Okeyinka Department of Computer Science Landmark University Kwara Nigeria
The minimal spanning tree is a structure used in solving certain types of combinatorial optimization problems. Popular application areas include network design such as roads, telephone, electrical and cable-laying. Th... 详细信息
来源: 评论
CENTERING A spanning tree OF A BICONNECTED GRAPH
收藏 引用
INFORMATION PROCESSING LETTERS 1989年 第5期32卷 247-250页
作者: CHESTON, GA FARLEY, A HEDETNIEMI, ST PROSKUROWSKI, A UNIV OREGON DEPT COMP SCIEUGENEOR 97403 CLEMSON UNIV DEPT COMP SCICLEMSONSC 29631
Given a biconnected graph G = ( V, E ), and an arbitrary vertex v in V , there exists a spanning tree T of G with v in the center of T . We prove this by providing an O(∣ V ∣ · ∣ E ∣) algorithm that construct... 详细信息
来源: 评论
Solving the information accumulation problem in mesh structured agent system
收藏 引用
IEEE TRANSACTIONS ON POWER SYSTEMS 2007年 第1期22卷 493-495页
作者: Huang, K. Srivastava, S. K. Cartes, D. A. Florida State Univ Ctr Adv Power Syst Tallahassee FL 32310 USA
In this letter, the authors propose a spanning tree-based algorithm for an agent system, which breaks the mesh-structured agent system into a single tree-structured agent system. Then an algorithm for recalculating th... 详细信息
来源: 评论
Cost Effective Dynamic Multi-Microgrid Formulation Method Using Deep Reinforcement Learning
Cost Effective Dynamic Multi-Microgrid Formulation Method Us...
收藏 引用
IEEE-Power-and-Energy-Society General Meeting (PESGM)
作者: Jung, YoonGun Chang, Minhyeok Kang, Sungwoo Jang, Gilsoo Lee, Hojun Yoon, Minhan Song, Sungyoon Han, Changhee Korea Univ Dept Elect Engn Seoul South Korea Kwangwoon Univ Dept Elect Engn Seoul South Korea Korea Electrotechnol Res Inst Adv Power Grid Div Uiwang South Korea Univ Calif San Diego Qualcomm Inst San Diego CA USA
This paper proposes an online Dynamic Multi-Microgrid Formulation (DIVIMF) method using Deep Reinforcement Learning. It aims to reconfigure the microgrid into several self-supplied islands and minimize total operation... 详细信息
来源: 评论
Determination of Safe Landing Zones for an Autonomous UAS using Elevation and Population Density Data
Determination of Safe Landing Zones for an Autonomous UAS us...
收藏 引用
AIAA Science and Technology (SciTech) Forum and Exposition
作者: Carney, Edward Castano, Lina Xu, Huan Univ Maryland Dept Aerosp Engn College Pk MD 20740 USA Univ Maryland Aerosp Engn College Pk MD 20740 USA Univ Maryland Aerosp Engn Inst Syst Res College Pk MD 20740 USA
This work determines a safe emergency landing zone for an autonomous UAS by utilizing ground elevation, terrain ruggedness, land coverage, and population density data. The proposed system uses openly available high-fi... 详细信息
来源: 评论
A GRAPH algorithmIC FRAMEWORK FOR THE ASSEMBLY OF SHREDDED DOCUMENTS
A GRAPH ALGORITHMIC FRAMEWORK FOR THE ASSEMBLY OF SHREDDED D...
收藏 引用
IEEE International Conference on Multimedia and Expo (ICME)
作者: Richter, Fabian Ries, Christian X. Lienhart, Rainer Univ Augsburg D-8900 Augsburg Germany
In this paper we propose a framework to address the reassembly of shredded documents. Inspired by the way humans approach this problem we introduce a novel algorithm that iteratively determines groups of fragments tha... 详细信息
来源: 评论