Sciweavers

1662 search results - page 21 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
PET
2004
Springer
15 years 3 months ago
Secure Outsourcing of Sequence Comparisons
Internet computing technologies, like grid computing, enable a weak computational device connected to such a grid to be less limited by its inadequate local computational, storage,...
Mikhail J. Atallah, Jiangtao Li
IPPS
2000
IEEE
15 years 2 months ago
Solving Problems on Parallel Computers by Cellular Programming
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
Domenico Talia
ATAL
2010
Springer
14 years 10 months ago
Assignment problem in requirements driven agent collaboration and its implementation
Requirements Driven Agent Collaboration (RDAC) is a mechanism where the self-interested service agents actively and autonomously search for the required services submitted by the ...
Jian Tang, Zhi Jin
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
15 years 2 months ago
Complexity of determining nonemptiness of the core
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
AAMAS
2010
Springer
14 years 9 months ago
Evolutionary mechanism design: a review
Abstract The advent of large-scale distributed systems poses unique engineering challenges. In open systems such as the internet it is not possible to prescribe the behaviour of al...
Steve Phelps, Peter McBurney, Simon Parsons