default search action
Tenda Okimoto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c27]Tenda Okimoto, Katsutoshi Hirayama:
Effect of Influential Variable Based Variable-Ordering Heuristic in Small-World Networks. IIAI-AAI 2023: 490-495 - 2022
- [j9]Katsutoshi Hirayama, Tenda Okimoto:
Bounded Approximate Payoff Division for MC-nets Games. IEICE Trans. Inf. Syst. 105-D(12): 2085-2091 (2022) - 2021
- [j8]Nicolas Schwind, Tenda Okimoto, Katsumi Inoue, Katsutoshi Hirayama, Jean-Marie Lagniez, Pierre Marquis:
On the computation of probabilistic coalition structures. Auton. Agents Multi Agent Syst. 35(1): 14 (2021) - 2020
- [j7]Kouki Matsumura, Bojana Kodric, Tenda Okimoto, Katsutoshi Hirayama:
Two approximation algorithms for probabilistic coalition structure generation with quality bound. Auton. Agents Multi Agent Syst. 34(1): 25 (2020)
2010 – 2019
- 2019
- [j6]Mutsunori Banbara, Katsumi Inoue, Benjamin Kaufmann, Tenda Okimoto, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Philipp Wanko:
teaspoon : solving the curriculum-based course timetabling problems with answer set programming. Ann. Oper. Res. 275(1): 3-37 (2019) - 2018
- [j5]Toshihiro Matsui, Marius Silaghi, Tenda Okimoto, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo:
Leximin Multiple Objective DCOPs on Factor Graphs for Preferences of Agents. Fundam. Informaticae 158(1-3): 63-91 (2018) - [c26]Emir Demirovic, Nicolas Schwind, Tenda Okimoto, Katsumi Inoue:
Recoverable Team Formation: Building Teams Resilient to Change. AAMAS 2018: 1362-1370 - [c25]Maxime Clement, Tenda Okimoto, Katsumi Inoue:
Multi-Objective Distributed Pseudo-Tree Optimization. AAMAS 2018: 1903-1905 - [c24]Nicolas Schwind, Tenda Okimoto, Katsumi Inoue, Katsutoshi Hirayama, Jean-Marie Lagniez, Pierre Marquis:
Probabilistic Coalition Structure Generation. KR 2018: 663-664 - [c23]Kouki Matsumura, Tenda Okimoto, Katsutoshi Hirayama:
Bounded Approximate Algorithm for Probabilistic Coalition Structure Generation. PRIMA 2018: 123-139 - [c22]Tenda Okimoto, Nicolas Schwind, Emir Demirovic, Katsumi Inoue, Pierre Marquis:
Robust Coalition Structure Generation. PRIMA 2018: 140-157 - 2017
- [j4]Maxime Clement, Tenda Okimoto, Katsumi Inoue:
Distributed Pareto Local Search for Multi-Objective DCOPs. IEICE Trans. Inf. Syst. 100-D(12): 2897-2905 (2017) - [c21]Mutsunori Banbara, Katsumi Inoue, Hiromasa Kaneyuki, Tenda Okimoto, Torsten Schaub, Takehide Soh, Naoyuki Tamura:
catnap: Generating Test Suites of Constrained Combinatorial Testing with Answer Set Programming. LPNMR 2017: 265-278 - 2016
- [j3]Nicolas Schwind, Morgan Magnin, Katsumi Inoue, Tenda Okimoto, Taisuke Sato, Kazuhiro Minami, Hiroshi Maruyama:
Formalization of resilience for constraint-based dynamic systems. J. Reliab. Intell. Environ. 2(1): 17-35 (2016) - [c20]Tenda Okimoto, Tony Ribeiro, Damien Bouchabou, Katsumi Inoue:
Mission Oriented Robust Multi-Team Formation and Its Application to Robot Rescue Simulation. IJCAI 2016: 454-460 - [c19]Nicolas Schwind, Tenda Okimoto, Maxime Clement, Katsumi Inoue:
Representative Solutions for Multi-Objective Constraint Optimization Problems. KR 2016: 601-604 - 2015
- [c18]Tenda Okimoto, Nicolas Schwind, Maxime Clement, Tony Ribeiro, Katsumi Inoue, Pierre Marquis:
How to Form a Task-Oriented Robust Team. AAMAS 2015: 395-403 - [c17]Maxime Clement, Tenda Okimoto, Nicolas Schwind, Katsumi Inoue:
Finding Resilient Solutions for Dynamic Multi-Objective Constraint Optimization Problems. ICAART (2) 2015: 509-516 - [c16]Toshihiro Matsui, Marius Silaghi, Tenda Okimoto, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo:
Leximin Asymmetric Multiple Objective DCOP on Factor Graph. PRIMA 2015: 134-151 - 2014
- [j2]Alexandre Medi, Tenda Okimoto, Katsumi Inoue:
A Two-Phase Complete Algorithm for Multi-Objective Distributed Constraint Optimization. J. Adv. Comput. Intell. Intell. Informatics 18(4): 573-580 (2014) - [c15]Tenda Okimoto, Nicolas Schwind, Maxime Clement, Katsumi Inoue:
Lp-Norm based algorithm for multi-objective distributed constraint optimization. AAMAS 2014: 1427-1428 - [c14]Tenda Okimoto, Tony Ribeiro, Maxime Clement, Katsumi Inoue:
Modeling and Algorithm for Dynamic Multi-objective Weighted Constraint Satisfaction Problem. ICAART (1) 2014: 420-427 - [c13]Nicolas Schwind, Tenda Okimoto, Sébastien Konieczny, Maxime Wack, Katsumi Inoue:
Utilitarian and Egalitarian Solutions for Multi-objective Constraint Optimization. ICTAI 2014: 170-177 - [c12]Maxime Wack, Tenda Okimoto, Maxime Clement, Katsumi Inoue:
Local Search Based Approximate Algorithm for Multi-Objective DCOPs. PRIMA 2014: 390-406 - 2013
- [c11]Nicolas Schwind, Tenda Okimoto, Katsumi Inoue, Hei Chan, Tony Ribeiro, Kazuhiro Minami, Hiroshi Maruyama:
Systems resilience: a challenge problem for dynamic constraint-based agent systems. AAMAS 2013: 785-788 - [c10]Yuko Sakurai, Tenda Okimoto, Masaaki Oka, Masato Shinoda, Makoto Yokoo:
Quality-control mechanism utilizing worker's confidence for crowdsourced tasks. AAMAS 2013: 1347-1348 - [c9]Tenda Okimoto, Naoto Ikegai, Katsumi Inoue, Hitoshi Okada, Tony Ribeiro, Hiroshi Maruyama:
Cyber security problem based on Multi-Objective Distributed Constraint Optimization technique. DSN Workshops 2013: 1-7 - [c8]Yuko Sakurai, Tenda Okimoto, Masaaki Oka, Masato Shinoda, Makoto Yokoo:
Ability Grouping of Crowd Workers via Reward Discrimination. HCOMP 2013: 147-155 - [c7]Tenda Okimoto, Maxime Clement, Katsumi Inoue:
AOF-Based Algorithm for Dynamic Multi-Objective Distributed Constraint Optimization. MIWAI 2013: 175-186 - [c6]Yuko Sakurai, Tenda Okimoto, Masaaki Oka, Makoto Yokoo:
Strategy-Proof Mechanisms for the k-Winner Selection Problem. PRIMA 2013: 292-307 - [c5]Maxime Clement, Tenda Okimoto, Tony Ribeiro, Katsumi Inoue:
Model and Algorithm for Dynamic Multi-Objective Distributed Optimization. PRIMA 2013: 413-420 - 2012
- [j1]Tenda Okimoto, Atsushi Iwasaki, Makoto Yokoo:
Effect of DisCSP variable-ordering heuristics in scale-free networks. Multiagent Grid Syst. 8(2): 127-141 (2012) - [c4]Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo:
Interactive Algorithm for Multi-Objective Constraint Optimization. CP 2012: 561-576 - 2011
- [c3]Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo:
Pseudo-tree-based algorithm for approximate distributed constraint optimization with quality bounds. AAMAS 2011: 1269-1270 - [c2]Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo, Boi Faltings:
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds. CP 2011: 660-674 - 2010
- [c1]Tenda Okimoto, Atsushi Iwasaki, Makoto Yokoo:
Effect of DisCSP Variable-Ordering Heuristics in Scale-Free Networks. PRIMA 2010: 166-180
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint