 | 2011 |
| 23 |  | Predrag T. Tosic,
Philip Dasler:
How to Play Well in Non-zero Sum Games: Some Lessons from Generalized Traveler's Dilemma.
AMT 2011: 300-311 |
| 2010 |
| 22 |  | Predrag T. Tosic,
Naveen K. R. Ginne:
Some Optimizations in Maximal Clique Based Distributed Coalition Formation for Collaborative Multi-Agent Systems.
AMT 2010: 353-360 |
| 21 |  | Predrag T. Tosic:
On the complexity of enumerating possible dynamics of sparsely connected Boolean network automata with simple update rules.
Automata 2010: 125-144 |
| 20 |  | Predrag T. Tosic,
Ricardo Vilalta:
Learning and Meta-Learning for Coordination of Autonomous Unmanned Vehicles - A Preliminary Analysis.
ECAI 2010: 163-168 |
| 19 |  | Predrag T. Tosic,
Naveen K. R. Ginne:
MCDCF: A Fully Distributed Algorithm for Coalition Formation in Collaborative Multi-Agent Systems.
IC-AI 2010: 957-963 |
| 18 |  | Predrag T. Tosic:
Some Challenges in Studying Resource-Bounded Autonomous Agents in Complex Multi-Agent Environments.
IKE 2010: 438-444 |
| 17 |  | Predrag T. Tosic:
Some Models for Autonomous Agents' Action Selection in Complex Partially Observable Environments.
IKE 2010: 452-458 |
| 16 |  | Predrag T. Tosic:
Cellular Automata Communication Models: Comparative Analysis of Parallel, Sequential and Asynchronous CA with Simple Threshold Update Rules.
IJNCR 1(3): 66-84 (2010) |
| 15 |  | Predrag T. Tosic,
Ricardo Vilalta:
A unified framework for reinforcement learning, co-learning and meta-learning how to coordinate in collaborative multi-agent systems.
Procedia CS 1(1): 2217-2226 (2010) |
| 2006 |
| 14 |  | Predrag T. Tosic:
On Modeling and Analyzing Sparsely Networked Large-Scale Multi-agent Systems with Cellular and Graph Automata.
International Conference on Computational Science (3) 2006: 272-280 |
| 13 |  | Predrag T. Tosic:
Computational Complexity of Some Enumeration Problems About Uniformly Sparse Boolean Network Automata.
Electronic Colloquium on Computational Complexity (ECCC) 13(159): (2006) |
| 12 |  | Predrag T. Tosic:
On the Complexity of Counting Fixed Points and Gardens of Eden in Sequential Dynamical Systems on Planar Bipartite Graphs.
Int. J. Found. Comput. Sci. 17(5): 1179-1204 (2006) |
| 2005 |
| 11 |  | Predrag T. Tosic,
Gul A. Agha:
Computational Complexity of Predicting Some Properties of Large-Scale Agent Ensembles' Dynamical Evolution.
EUMAS 2005: 415-426 |
| 10 |  | Predrag T. Tosic:
On Counting Fixed Point Configurations in Star Networks.
IPDPS 2005 |
| 9 |  | Predrag T. Tosic,
Gul A. Agha:
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata.
UC 2005: 191-205 |
| 8 |  | Predrag T. Tosic:
On Complexity of Counting Fixed Points in Certain Classes of Graph Automata
Electronic Colloquium on Computational Complexity (ECCC)(051): (2005) |
| 7 |  | Predrag T. Tosic:
Counting Fixed Points and Gardens of Eden of Sequential Dynamical Systems on Planar Bipartite Graphs
Electronic Colloquium on Computational Complexity (ECCC)(091): (2005) |
| 2004 |
| 6 |  | Predrag T. Tosic,
Gul Agha:
Characterizing Configuration Spaces of Simple Threshold Cellular Automata.
ACRI 2004: 861-870 |
| 5 |  | Predrag T. Tosic:
A perspective on the future of massively parallel computing: fine-grain vs. coarse-grain parallel models comparison & contrast.
Conf. Computing Frontiers 2004: 488-502 |
| 4 |  | Predrag T. Tosic,
Gul Agha:
Concurrency vs. Sequential Interleavings in 1-D Threshold Cellular Automata.
IPDPS 2004 |
| 3 |  | Predrag T. Tosic,
Gul A. Agha:
Maximal Clique Based Distributed Coalition Formation for Task Allocation in Large-Scale Multi-agent Systems.
MMAS 2004: 104-120 |
| 2 |  | Predrag T. Tosic,
Gul A. Agha:
Towards a hierarchical taxonomy of autonomous agents.
SMC (4) 2004: 3421-3426 |
| 2001 |
| 1 |  | Christopher L. Barrett,
Harry B. Hunt III,
Madhav V. Marathe,
S. S. Ravi,
Daniel J. Rosenkrantz,
Richard Edwin Stearns,
Predrag T. Tosic:
Gardens of Eden and Fixed Points in Sequential Dynamical Systems.
DM-CCG 2001: 95-110 |