位置：成果数据库 > 会议 > 会议详情页
A Modified K-Shortest Paths Algorithm for Solving the Earliest Arrival Problem on the Time-Dependent
  • 所属机构名称：清华大学
  • 会议名称：IAENG International Conference on Operations Research (ICOR'12)
  • 成果类型：会议
  • 相关项目：基于KKT条件的优化递归神经网络簇设计
作者： Li, Jianmin|Xu, Bingji|Hu, Xiaolin|Wang, Shuai|Yang, Yang|
同会议论文项目
基于KKT条件的优化递归神经网络簇设计
期刊论文 6 会议论文 7 获奖 1
同项目会议论文
Learning Complex Image Patterns with Scale and Shift Invariant Sparse Coding.
Learning hierarchical dictionary for shape patterns
Solving the assignment problem with the improved dual neural network
Infinite Latent SVM for Classification and Multi-task Learning
Motion Planning with Obstacle Avoidance for Kinematically Redundant Manipulators Based on Two Recurr
Another Simple Recurrent Neural Network for Quadratic and Linear Programming