Art

J-GLOBAL ID：201702252303416341   Reference number：17A1776452

An optimal routing search method on the network routing problem using the sequential minimal optimization

逐次最小最適化を用いたネットワークルーティング問題に対する最適経路探索法【Powered by NICT】

Author (3)： Toyoda Kazuhiro (Graduate School of Science and Engineering, Chiba University, Chiba, Japan) ,  Okamoto Takashi (Graduate School of Engineering, Chiba University, Chiba, Japan) ,  Koakutsu Seiichi (Graduate School of Engineering, Chiba University, Chiba, Japan)
Material： IEEE Conference Proceedings  (IEEE Conf Proc)
Volume： 2017  Issue： SICE  Page： 805-810  Publication year： 2017 
JST Material Number： W2441A  Document type： Proceedings
Article type： 原著論文  Country of issue： United States (USA)  Language： ENGLISH (EN)

Abstract/Point： The network routing problem is...

Register(free) or Log In to access     To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=17A1776452&from=J-GLOBAL&jstjournalNo=W2441A") }}

Thesaurus term： routing ,  *optimum route ,  formulation ,  linearity ,  support vector machine ,  game ,  optimization problem ,  *network ,  *optimization ,  high speed ,  Learning ,  calculation cost ,  numerical experiment ,  equality constraints ,  *search method ,  *modification

JST classification (2)： Pattern recognition  (JE07000S) ,  Artificial intelligence  (JE08000Z)

Terms in the title (3)： 最適化 ,  ネットワークルーティング ,  経路探索