1662 search results - page 62 / 333 » The Computational Complexity of Agent Design Problems |
162
Voted
DAC
2000
ACM
16 years 4 months ago
2000
ACM
In this paper, we introduce a new technique for modeling and solving the dynamic power management (DPM) problem for systems with complex behavioral characteristics such as concurr...
111
Voted
AAAI
2008
15 years 5 months ago
2008
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
107
Voted
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...
131
Voted
CLIMA
2004
15 years 4 months ago
2004
Communication plays a fundamental role in multi-agents systems. One of the main issues in the design of agent interaction protocols is the verification that a given protocol implem...
132
click to vote
ICDCN
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...