44 search results - page 9 / 9 » Bounding Rationality by Discounting Time |
IJCAI
1993
14 years 10 months ago
1993
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
ANTS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
76
Voted
ROBOCUP
1999
Springer
15 years 1 months ago
1999
Springer
The underlying research topics and the architecture of the UBU team are briefly described. The aim of developing UBU is to subject a series of tools and procedures for agent decis...