( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Strategies for Challenging Two-player Games - Some Lessons from Iterated Traveler's Dilemma.

, и . ICAART (2), стр. 72-82. SciTePress, (2012)

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.

Oliver Tosic

Predrag Maksimovic

Predrag Ili

Predrag Gruji

Predrag Vlaji

 

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

On Modeling and Analyzing Sparsely Networked Large-Scale Multi-agent Systems with Cellular and Graph Automata.. International Conference on Computational Science (3), том 3993 из Lecture Notes in Computer Science, стр. 272-280. Springer, (2006)Maximal Clique Based Distributed Coalition Formation for Task Allocation in Large-Scale Multi-agent Systems., и . MMAS, том 3446 из Lecture Notes in Computer Science, стр. 104-120. Springer, (2004)Maximal Clique Based Distributed Coalition Formation for Task Allocation in Large-Scale Multi-agent Systems, и . Massively Multi-Agent Systems I, том 3446 из Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2005)Computational Complexity of Some Enumeration Problems About Uniformly Sparse Boolean Network Automata.. Electron. Colloquium Comput. Complex., (2006)Counting Fixed Points and Gardens of Eden of Sequential Dynamical Systems on Planar Bipartite Graphs.. Electron. Colloquium Comput. Complex., (2005)Strategies for Challenging Two-player Games - Some Lessons from Iterated Traveler's Dilemma., и . ICAART (2), стр. 72-82. SciTePress, (2012)Cellular Automata Communication Models: Comparative Analysis of Parallel, Sequential and Asynchronous CA with Simple Threshold Update Rules.. IJNCR, 1 (3): 66-84 (2010)On Counting Fixed Point Configurations in Star Networks.. IPDPS, IEEE Computer Society, (2005)Efficiently repairing and measuring replica consistency in distributed databases., , и . Distributed Parallel Databases, 31 (3): 377-411 (2013)On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata., и . UC, том 3699 из Lecture Notes in Computer Science, стр. 191-205. Springer, (2005)