Kousuke Shinoda

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Masayuki Ohta

> Home > Persons > Kousuke Shinoda

Publications

2005
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/atal/NodaOKSN05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/atal/NodaOKSN05
Itsuki Noda, Masayuki Ohta, Yoichiro Kumada, Kousuke Shinoda, Hideyuki Nakashima:
Usability of dial-a-ride systems. AAMAS 2005: 1281-1282
2003
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/mabs/NodaOSKN03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mabs/NodaOSKN03
Itsuki Noda, Masayuki Ohta, Kousuke Shinoda, Yoichiro Kumada, Hideyuki Nakashima:
Evaluation of Usability of Dial-a-Ride Systems by Social Simulation. MABS 2003: 167-181
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/mamus/ShinodaNOKN03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mamus/ShinodaNOKN03
Kousuke Shinoda, Itsuki Noda, Masayuki Ohta, Yoichiro Kumada, Hideyuki Nakashima:
Is Dial-a-Ride Bus Reasonable in Large Scale Towns? Evaluation of Usability of Dial-a-Ride Systems by Simulation. MAMUS 2003: 105-119
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/robocup/ShinodaNOK03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/robocup/ShinodaNOK03
Kousuke Shinoda, Itsuki Noda, Masayuki Ohta, Susumu Kunifuji:
Application of Parallel Scenario Description for RoboCupRescue Civilian Agent. RoboCup 2003: 628-636

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.