10568 search results - page 585 / 2114 » Computer Intelligence and Formalization |
184
click to vote
AI
2007
Springer
16 years 26 days ago
2007
Springer
DEC-POMDPs provide formal models of many cooperative multiagent problems, but their complexity is NEXP-complete in general. We investigate a sub-class of DEC-POMDPs termed multiage...
209
Voted
APN
2007
Springer
16 years 25 days ago
2007
Springer
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ...
160
click to vote
CIA
2007
Springer
16 years 25 days ago
2007
Springer
Past years have witnessed a growing interest in automated negotiation as a coordination mechanism for interacting agents. This paper presents a generic, problem- and domain-indepen...
172
click to vote
EVOW
2007
Springer
16 years 25 days ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
147
click to vote
HOLOMAS
2007
Springer
16 years 25 days ago
2007
Springer
We present a formal approach to conception of a dedicated security infrastructure based on the exception handling in the protected agents. Securityrelated exceptions are identifie...