Sciweavers

1662 search results - page 60 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
STACS
2010
Springer
14 years 3 months ago
Treewidth Reduction for Constrained Separation and Bipartization Problems
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
Dániel Marx, Barry O'Sullivan, Igor Razgon
IAT
2009
IEEE
14 years 3 months ago
Simulating BDI-Based Wireless Sensor Networks
—“Autonomic systems” merge advancements in the field of multi-agent software design, dynamic analysis, and decentralized control in order to assist designers in constructing...
Alexis Morris, Paolo Giorgini, Sameh Abdel-Naby
INFORMATICALT
2010
116views more  INFORMATICALT 2010»
13 years 6 months ago
A Dynamic Network Interdiction Problem
We present a novel dynamic network interdiction model that accounts for interactions between an interdictor deploying resources on arcs in a digraph and an evader traversing the ne...
Brian J. Lunday, Hanif D. Sherali
FOCS
2005
IEEE
14 years 2 months ago
Beyond VCG: Frugality of Truthful Mechanisms
We study truthful mechanisms for auctions in which the auctioneer is trying to hire a team of agents to perform a complex task, and paying them for their work. As common in the ...
Anna R. Karlin, David Kempe, Tami Tamir
ATAL
2005
Springer
14 years 2 months ago
Evaluating the Minority Game strategy in agent role assignments
A team-based competitive environment is a complex multiagent environment, in which agents are required to coordinate with each other not only to enhance their collective behavior,...
Tingting Wang, Jiming Liu