Sciweavers

1662 search results - page 155 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
ATAL
2008
Springer
15 years 6 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
ACMICEC
2006
ACM
111views ECommerce» more  ACMICEC 2006»
15 years 7 months ago
Passive verification of the strategyproofness of mechanisms in open environments
Consider an open infrastructure in which anyone can deploy mechanisms to support automated decision making and coordination amongst self-interested computational agents. Strategyp...
Laura Kang, David C. Parkes
DAC
2010
ACM
15 years 4 months ago
A correlation-based design space exploration methodology for multi-processor systems-on-chip
Given the increasing complexity of multi-processor systems-onchip, a wide range of parameters must be tuned to find the best trade-offs in terms of the selected system figures of ...
Giovanni Mariani, Aleksandar Brankovic, Gianluca P...
142
Voted
IPTPS
2003
Springer
15 years 9 months ago
Rationality and Self-Interest in Peer to Peer Networks
Much of the existing work in peer to peer networking assumes that users will follow prescribed protocols without deviation. This assumption ignores the user’s ability to modify ...
Jeffrey Shneidman, David C. Parkes
BMCBI
2006
100views more  BMCBI 2006»
15 years 4 months ago
Design of microarray probes for virus identification and detection of emerging viruses at the genus level
Background: Most virus detection methods are geared towards the detection of specific single viruses or just a few known targets, and lack the capability to uncover the novel viru...
Cheng-Chung Chou, Te-Tsui Lee, Chun-Houh Chen, Hsi...