Search Results - Okimoto, Tenda

  • Showing 1 - 9 results of 9
Refine Results
  1. 1
    On the computation of probabilistic coalition structures

    On the computation of probabilistic coalition structures by Schwind, Nicolas, Okimoto, Tenda, Inoue, Katsumi, Hirayama, Katsutoshi, Lagniez, Jean-Marie, Marquis, Pierre

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 2
    Distributed Stochastic Search Algorithm for Multi-ship Encounter Situations

    Distributed Stochastic Search Algorithm for Multi-ship Encounter Situations by Kim, Donggyun, Hirayama, Katsutoshi, Okimoto, Tenda

    Published in Journal of navigation
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  3. 3
    Two approximation algorithms for probabilistic coalition structure generation with quality bound

    Two approximation algorithms for probabilistic coalition structure generation with quality bound by Matsumura, Kouki, Kodric, Bojana, Okimoto, Tenda, Hirayama, Katsutoshi

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  4. 4
    A Two-Phase Complete Algorithm for Multi-Objective Distributed Constraint Optimization

    A Two-Phase Complete Algorithm for Multi-Objective Distributed Constraint Optimization by Medi, Alexandre, Okimoto, Tenda, Inoue, Katsumi

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  5. 5
    teaspoon: solving the curriculum-based course timetabling problems with answer set programming

    teaspoon: solving the curriculum-based course timetabling problems with answer set programming by Banbara, Mutsunori, Inoue, Katsumi, Kaufmann, Benjamin, Okimoto, Tenda, Schaub, Torsten, Soh, Takehide, Tamura, Naoyuki, Wanko, Philipp

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  6. 6
    {\varvec{teaspoon}}$$: solving the curriculum-based course timetabling problems with answer set programming

    {\varvec{teaspoon}}$$: solving the curriculum-based course timetabling problems with answer set programming by Banbara, Mutsunori, Inoue, Katsumi, Kaufmann, Benjamin, Okimoto, Tenda, Schaub, Torsten, Soh, Takehide, Tamura, Naoyuki

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  7. 7
    Formalization of resilience for constraint-based dynamic systems

    Formalization of resilience for constraint-based dynamic systems by Schwind, Nicolas, Magnin, Morgan, Inoue, Katsumi, Okimoto, Tenda, Sato, Taisuke, Minami, Kazuhiro, Maruyama, Hiroshi

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  8. 8
    Utilitarian and Egalitarian Solutions for Multi-objective Constraint Optimization

    Utilitarian and Egalitarian Solutions for Multi-objective Constraint Optimization by Schwind, Nicolas, Okimoto, Tenda, Konieczny, Sebastien, Wack, Maxime, Inoue, Katsumi

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  9. 9
    Cyber security problem based on Multi-Objective Distributed Constraint Optimization technique

    Cyber security problem based on Multi-Objective Distributed Constraint Optimization technique by Okimoto, Tenda, Ikegai, Naoto, Inoue, Katsumi, Okada, Hitoshi, Ribeiro, Tony, Maruyama, Hiroshi

    Request full text
    Conference Proceeding
    Save to List
    Saved in:

Search Tools: