欢迎您!
东篱公司
退出
申报数据库
申报指南
立项数据库
成果数据库
期刊论文
会议论文
著 作
专 利
项目获奖数据库
位置:
成果数据库
>
会议
> 会议详情页
A new algorithm of generating a minimum spanning tree of a graph based on recursion
所属机构名称:同济大学
会议名称:2013 International Conference on Information Engineering, ICIE 2013
时间:2014
成果类型:会议
相关项目:大规模定制服务系统的Petri网语义模型与关键技术研究
同会议论文项目
大规模定制服务系统的Petri网语义模型与关键技术研究
期刊论文 27
会议论文 15
获奖 2
同项目会议论文
Real-time traffic camera-light control systems for intersections subject to accidents: A Petri net a
A Performance Visualization Method for OpenMP Tasks
PEWP: Process extraction based on word position in documents
A Self-learning Clustering Algorithm Based on Clustering Coefficient
Analysis for one-place unbounded Petri nets based on modified reachability trees
A New Modified Reachability Graph of w-independent Petri Nets and Its Applications
双向Web服务组合
A Petri net based automatic executable code generation method for web service composition
A relational taxonomy of services for large scale service repositories
A Petri Nets Based Approach for Detecting the Data Races and Deadlocks in OpenMP Program
An efficient webpage classification algorithm based on LSH
A task scheduling strategy based on weighted round-robin for distributed crawler
Performance evaluation of composite web service based on transaction
An Indexing Network Model for Information Services and Its Applications