2024 search results - page 215 / 405 » The cost of social agents |
167
click to vote
KR
1994
Springer
15 years 10 months ago
1994
Springer
Probabilistic AI planning methods that minimize expected execution cost have a neutral attitude towards risk. We demonstrate how one can transform planning problems for risk-sensi...
158
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
In a previous work we extended the notion of multi-unit combinatorial reverse auction (MUCRA) by adding a new dimension to the goods at auction. A buyer can express transformabilit...
172
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Computer agents participate in many collaborative and competitive multiagent domains in which humans make decisions. For computer agents to interact successfully with people in su...
164
click to vote
AIPS
2008
15 years 9 months ago
2008
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
149
click to vote
AAAI
1993
15 years 8 months ago
1993
The Rete and Treat algorithms are considered the most efficient implementation techniques for Forward Chaining rule systems. These algorithms support a language of limited express...