Sciweavers

1662 search results - page 20 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
13 years 12 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
AAAI
2006
13 years 9 months ago
Mechanisms for Partial Information Elicitation: The Truth, but Not the Whole Truth
We examine a setting in which a buyer wishes to purchase probabilistic information from some agent. The seller must invest effort in order to gain access to the information, and m...
Aviv Zohar, Jeffrey S. Rosenschein
ATAL
2005
Springer
14 years 1 months ago
Mechanism design and deliberative agents
The central mechanism design problem is to develop incentives for agents to truthfully reveal their preferences over different outcomes, so that the system-wide outcome chosen by ...
Kate Larson, Tuomas Sandholm
ATAL
2007
Springer
14 years 1 months ago
Embedding Landmarks and Scenes in a Computational Model of Institutions
Over the last decade, institutions have demonstrated that they are a powerful mechanism to make agent interactions more effective, structured, coordinated and efficient. Different...
Owen Cliffe, Marina De Vos, Julian A. Padget
ISORC
2003
IEEE
14 years 23 days ago
A Dynamic Shadow Approach for Mobile Agents to Survive Crash Failures
Fault tolerance schemes for mobile agents to survive agent server crash failures are complex since developers normally have no control over remote agent servers. Some solutions mo...
Simon Pears, Jie Xu, Cornelia Boldyreff