国家自然科学基金(BK2009015)

作品数：3被引量：11H指数：1
导出分析报告
相关作者：孙璐徐冰顾文钧陈鲤梁黄志更多>>
相关机构：东南大学华中科技大学更多>>
相关期刊：《Journal of Southeast University(English Edition)》更多>>
相关主题：MIN-MAXWEIGHTOPTIMIZATIONMAXN-更多>>
相关领域：交通运输工程自动化与计算机技术更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-3
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
A min-max optimization approach for weight determination in analytic hierarchy process被引量：10
《Journal of Southeast University(English Edition)》2012年第2期245-250,共6页孙璐 
The US National Science Foundation (No. CMMI-0408390,CMMI-0644552,BCS-0527508);the National Natural Science Foundation of China (No. 51010044,U1134206);the Fok YingTong Education Foundation (No. 114024);the Natural Science Foundation of Jiangsu Province (No. BK2009015);the Postdoctoral Science Foundation of Jiangsu Province (No. 0901005C)
A min-max optimization method is proposed as a new approach to deal with the weight determination problem in the context of the analytic hierarchy process. The priority is obtained through minimizing the maximal absol...
关键词：analytic hierarchy process rain-max optimization WEIGHT linear programming 
Gaussian mixture models for clustering and classifying traffic flow in real-time for traffic operation and management被引量：1
《Journal of Southeast University(English Edition)》2011年第2期174-179,共6页孙璐 张惠民 高荣 顾文钧 徐冰 陈鲤梁 
The US National Science Foundation (No. CMMI-0408390,CMMI-0644552);the American Chemical Society Petroleum Research Foundation (No.PRF-44468-G9);the Research Fellowship for International Young Scientists (No.51050110143);the Fok Ying-Tong Education Foundation (No.114024);the Natural Science Foundation of Jiangsu Province (No.BK2009015);the Postdoctoral Science Foundation of Jiangsu Province (No.0901005C)
Based on Gaussian mixture models（GMM）, speed, flow and occupancy are used together in the cluster analysis of traffic flow data. Compared with other clustering and sorting techniques, as a structural model, the GMM ...
关键词：traffic flow patterns Gaussian mixture model level of service data mining cluster analysis CLASSIFIER 
Infeasibility test algorithm and fast repair algorithm of job shop scheduling problem
《Journal of Southeast University(English Edition)》2011年第1期88-91,共4页孙璐 黄志 张惠民 顾文钧 
The US National Science Foundation (No. CMMI-0408390, CMMI-0644552);the Research Fellowship for International Young Scientists (No. 51050110143);the Fok Ying-Tong Education Foundation(No. 114024);the Natural Science Foundation of Jiangsu Province (No.BK2009015);the Postdoctoral Science Foundation of Jiangsu Province (No.0901005C)
To diagnose the feasibility of the solution of a job-shop scheduling problem（JSSP）,a test algorithm based on diagraph and heuristic search is developed and verified through a case study.Meanwhile,a new repair algori...
关键词：INFEASIBILITY job shop scheduling repairing algorithm 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部