9842 search results - page 1481 / 1969 » The Complexity of the Matching-Cut Problem |
153
click to vote
AOSE
2004
Springer
16 years 12 days ago
2004
Springer
Abstract. Engineering non-trivial open multi-agent systems is a challenging task. Our research focusses on situated multi-agent systems, i.e. systems in which agents are explicitly...
187
click to vote
ARGMAS
2004
Springer
16 years 12 days ago
2004
Springer
In this paper we propose a new persuasion dialogue game for agent communication. We show how this dialogue game is modeled by a framework based on social commitments and arguments....
164
click to vote
ATAL
2004
Springer
16 years 12 days ago
2004
Springer
This paper presents an algorithm for learning the meaning of messages communicated between agents that interact while acting optimally towards a cooperative goal. Our reinforcemen...
178
click to vote
CIS
2004
Springer
16 years 12 days ago
2004
Springer
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
159
click to vote
CONCUR
2004
Springer
16 years 12 days ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...