The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jonathan P. Pearce: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rajiv T. Maheswaran, Jonathan P. Pearce, Milind Tambe
    Distributed Algorithms for DCOP: A Graphical-Game-Based Approach. [Citation Graph (0, 0)][DBLP]
    ISCA PDCS, 2004, pp:432-439 [Conf]
  2. Rachel Greenstadt, Jonathan P. Pearce, Milind Tambe
    Analysis of Privacy Loss in Distributed Constraint Optimization. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  3. Jonathan P. Pearce
    Locally Optimal Algorithms and Solutions for Distributed Constraint Optimization. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  4. Pauline M. Berry, Cory Albright, Emma Bowring, Ken Conley, Kenneth Nitz, Jonathan P. Pearce, Bart Peintner, Shahin Saadati, Milind Tambe, Tomás E. Uribe, Neil Yorke-Smith
    Conflict negotiation among personal calendar agents. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2006, pp:1467-1468 [Conf]
  5. Rachel Greenstadt, Jonathan P. Pearce, Emma Bowring, Milind Tambe
    Experimental analysis of privacy loss in DCOP algorithms. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2006, pp:1424-1426 [Conf]
  6. Rajiv T. Maheswaran, Jonathan P. Pearce, Pradeep Varakantham, Emma Bowring, Milind Tambe
    Valuations of Possible States (VPS): a quantitative framework for analysis of privacy loss among collaborative personal assistant agents. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2005, pp:1030-1037 [Conf]
  7. Rajiv T. Maheswaran, Milind Tambe, Emma Bowring, Jonathan P. Pearce, Pradeep Varakantham
    Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2004, pp:310-317 [Conf]
  8. Jonathan P. Pearce, Rajiv T. Maheswaran, Milind Tambe
    How local is that optimum? k-optimality for DCOP. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2005, pp:1303-1304 [Conf]
  9. Jonathan P. Pearce, Rajiv T. Maheswaran, Milind Tambe
    Solution sets for DCOPs and graphical games. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2006, pp:577-584 [Conf]
  10. Milind Tambe, Emma Bowring, Hyuckchul Jung, Gal A. Kaminka, Rajiv T. Maheswaran, Janusz Marecki, Pragnesh Jay Modi, Ranjit Nair, Stephen Okamoto, Jonathan P. Pearce, Praveen Paruchuri, David V. Pynadath, Paul Scerri, Nathan Schurr, Pradeep Varakantham
    Conflicts in teamwork: hybrids to the rescue. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2005, pp:3-10 [Conf]
  11. Jonathan P. Pearce, Milind Tambe
    Quality Guarantees on k-Optimal Solutions for Distributed Constraint Optimization Problems. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:1446-1451 [Conf]
  12. Rajiv T. Maheswaran, Jonathan P. Pearce, Emma Bowring, Pradeep Varakantham, Milind Tambe
    Privacy Loss in Distributed Constraint Reasoning: A Quantitative Framework for Analysis and its Applications. [Citation Graph (0, 0)][DBLP]
    Autonomous Agents and Multi-Agent Systems, 2006, v:13, n:1, pp:27-60 [Journal]

  13. Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications. [Citation Graph (, )][DBLP]


  14. An efficient heuristic approach for security against multiple adversaries. [Citation Graph (, )][DBLP]


  15. Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games. [Citation Graph (, )][DBLP]


  16. On k-optimal distributed constraint optimization algorithms: new bounds and algorithms. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002