1662 search results - page 42 / 333 » The Computational Complexity of Agent Design Problems |
IAT
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
SIGECOM
2004
ACM
14 years 1 months ago
2004
ACM
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
PAAMS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
AAAI
1996
13 years 9 months ago
1996
In this paper we describe the design and implementation of the derivation replay framework, dersnlp+ebl (Derivational snlp+ebl), which is based within a partial order planner. der...