1662 search results - page 167 / 333 » The Computational Complexity of Agent Design Problems |
158
click to vote
AAAI
2006
15 years 5 months ago
2006
Reinforcement learning problems are commonly tackled with temporal difference methods, which attempt to estimate the agent's optimal value function. In most real-world proble...
127
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
The Trading Agent Competition in its category Supply Chain Management (TAC SCM) is an international forum where teams construct agents that control a computer assembly company in ...
115
click to vote
GLVLSI
2007
IEEE
15 years 10 months ago
2007
IEEE
LNS (logarithmic number system) arithmetic has the advantages of high-precision and high performance in complex function computation. However, the large hardware problem in LNS ad...
114
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Failures in plan execution can be attributed to errors in the execution of plan steps or violations of the plan structure. The structure of a plan prescribes which actions have to...
124
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...