1662 search results - page 77 / 333 » The Computational Complexity of Agent Design Problems |
EUMAS
2006
13 years 10 months ago
2006
Fault tolerance is an important property of large-scale multiagent systems as the failure rate grows with both the number of the hosts and deployed agents, and the duration of com...
AAAI
2012
11 years 11 months ago
2012
This paper addresses the problem of automated advice provision in settings that involve repeated interactions between people and computer agents. This problem arises in many real ...
DCC
2006
IEEE
14 years 16 days ago
2006
IEEE
Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far ha...
ICPPW
2009
IEEE
13 years 6 months ago
2009
IEEE
In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction proble...
CRYPTO
2008
Springer
13 years 10 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...