Sciweavers

12107 search results - page 2242 / 2422
» Software That Can Think
Sort
View
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
15 years 11 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
WWW
2003
ACM
15 years 11 months ago
Finnish Museums on the Semantic Web
This article presents the semantic portal MUSEUMFINLAND for publishing heterogeneous museum collections on the Semantic Web. It is shown how museums with their semantically rich a...
Eero Hyvönen, Suvi Kettula, Vilho Raatikka, S...
ATAL
2003
Springer
15 years 11 months ago
Model checking agentspeak
This paper introduces AgentSpeak(F), a variation of the BDI logic programming language AgentSpeak(L) intended to permit the model-theoretic verification of multi-agent systems. A...
Rafael H. Bordini, Michael Fisher, Carmen Pardavil...
ATAL
2003
Springer
15 years 11 months ago
A prototype infrastructure for distributed robot-agent-person teams
Effective coordination of robots, agents and people promises to improve the safety, robustness and quality with which shared goals are achieved by harnessing the highly heterogene...
Paul Scerri, David V. Pynadath, W. Lewis Johnson, ...
FSTTCS
2003
Springer
15 years 11 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
« Prev « First page 2242 / 2422 Last » Next »