( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications.

, , , , , и . AAAI, стр. 1559-1562. AAAI Press, (2008)

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.

Danny Pearce

Olinkha Gustafson-Pearce

Jonathan Vöglein

Jonathan Dörr

Jonathan Burmeister

 

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

Privacy Loss in Distributed Constraint Reasoning: A Quantitative Framework for Analysis and its Applications., , , , и . Auton. Agents Multi Agent Syst., 13 (1): 27-60 (2006)Coordinating randomized policies for increasing security of agent systems., , , , , и . Inf. Technol. Manag., 10 (1): 67-79 (2009)Experimental analysis of privacy loss in DCOP algorithms., , , и . AAMAS, стр. 1424-1426. ACM, (2006)Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling., , , , и . AAMAS, стр. 310-317. IEEE Computer Society, (2004)An efficient heuristic approach for security against multiple adversaries., , , , и . AAMAS, стр. 181. IFAAMAS, (2007)Valuations of Possible States (VPS): a quantitative framework for analysis of privacy loss among collaborative personal assistant agents., , , , и . AAMAS, стр. 1030-1037. ACM, (2005)How local is that optimum? k-optimality for DCOP., , и . AAMAS, стр. 1303-1304. ACM, (2005)Analysis of Privacy Loss in Distributed Constraint Optimization., , и . AAAI, стр. 647-653. AAAI Press, (2006)Solution sets for DCOPs and graphical games., , и . AAMAS, стр. 577-584. ACM, (2006)Locally Optimal Algorithms and Solutions for Distributed Constraint Optimization.. AAAI, AAAI Press, (2006)