( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Pseudo-tree-based algorithm for approximate distributed constraint optimization with quality bounds.

, , , и . AAMAS, стр. 1269-1270. IFAAMAS, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

No persons found for author name Okimoto, Tenda
add a person with the name Okimoto, Tenda
 

Другие публикации лиц с тем же именем

Ability Grouping of Crowd Workers via Reward Discrimination., , , , и . HCOMP, стр. 147-155. AAAI, (2013)Finding Resilient Solutions for Dynamic Multi-Objective Constraint Optimization Problems., , , и . ICAART (2), стр. 509-516. SciTePress, (2015)Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds., , , , и . CP, том 6876 из Lecture Notes in Computer Science, стр. 660-674. Springer, (2011)Effect of DisCSP Variable-Ordering Heuristics in Scale-Free Networks., , и . PRIMA, том 7057 из Lecture Notes in Computer Science, стр. 166-180. Springer, (2010)Bounded Approximate Algorithm for Probabilistic Coalition Structure Generation., , и . PRIMA, том 11224 из Lecture Notes in Computer Science, стр. 123-139. Springer, (2018)Pseudo-tree-based algorithm for approximate distributed constraint optimization with quality bounds., , , и . AAMAS, стр. 1269-1270. IFAAMAS, (2011)Probabilistic Coalition Structure Generation., , , , , и . KR, стр. 663-664. AAAI Press, (2018)How to Form a Task-Oriented Robust Team., , , , , и . AAMAS, стр. 395-403. ACM, (2015)Cyber security problem based on Multi-Objective Distributed Constraint Optimization technique., , , , , и . DSN Workshops, стр. 1-7. IEEE Computer Society, (2013)Distributed Pareto Local Search for Multi-Objective DCOPs., , и . IEICE Trans. Inf. Syst., 100-D (12): 2897-2905 (2017)