| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| IN, NS (Joint) |
2023-03-02 11:00 |
Okinawa | Okinawa Convention Centre + Online (Primary: On-site, Secondary: Online) |
Resource allocation methods for efficient and fairness utilization of network and computational resources in edge cloud
-- Scalable resource allocation and network path selection -- Shota Akiyoshi (Kyutech), Yuzo Taenaka (NAIST), Kazuya Tsukamoto (Kyutech)  NS2022-170 |
Cross-domain data fusion in the edge cloud is becoming a key driver to growth of the numerous and diverse applications i... [more] | NS2022-170 pp.19-24 |
| PRMU, IBISML, IPSJ-CVIM [detail] | 2011-09-05 13:30 |
Hokkaido | [Invited Talk]
Optimal Solution Path Following Algorithm for Pattern Recognition and Machine Learning Ichiro Takeuchi (NIT) PRMU2011-66 IBISML2011-25 |
Many pattern classification and machine learning algorithms are formulated as mathematical optimization problems. These ... [more] | PRMU2011-66 IBISML2011-25 pp.59-60 |
|
| MoNA, IPSJ-AVM | 2011-07-14 13:20 |
Nara | Nara Institute of Science and Technology | SCTP Optimum Path Selection using Ant Colony Optimization Approach and Heartbeat Chunks Muhammad Ariff Bin Baharudin, Eiji Kamioka (Shibaura Inst. of Tech.) MoMuC2011-13 |
This paper proposes an optimum path selection approach by using the Ant Colony Optimization (ACO) technique and HEARTBEA... [more] | MoMuC2011-13 pp.1-6 |
| KBSE | 2011-01-25 13:10 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Data Structure that Makes Extended Dijkstra Method Work. Tomoaki Ogawa (NIT) |
Routes selection is one of the most important problems for a car navigation system．Moreover, when selecting a path, the ... [more] | |
| MSS, CAS | 2010-11-19 16:10 |
Osaka | Kansai Univ. | Braess's Paradox in Graph B^k with Two Sources Shimpei Hamaguchi, Takafumi Kanazawa, Toshimitsu Ushio (Osaka Univ.) CAS2010-82 CST2010-55 |
Selfish routing is a selfish route selection of players in computer networks. Players are assumed to select paths so as ... [more] | CAS2010-82 CST2010-55 pp.95-99 |
| CAS, MSS, VLD, SIP | 2010-06-21 13:30 |
Hokkaido | Kitami Institute of Technology | Braess's Paradox in a Two-source Network Shimpei Hamaguchi, Takafumi Kanazawa, Toshimitsu Ushio (Osaka Univ.) CAS2010-9 VLD2010-19 SIP2010-30 CST2010-9 |
Selfish routing is a selfish route selection of players in computer networks. Players are assumed to select paths so as ... [more] | CAS2010-9 VLD2010-19 SIP2010-30 CST2010-9 pp.47-52 |
[Return to Top Page]