1683 search results - page 80 / 337 » Game Theory Basics |
111
click to vote
NIPS
2000
15 years 5 months ago
2000
We introduce total wire length as salient complexity measure for an analysis of the circuit complexity of sensory processing in biological neural systems and neuromorphic engineer...
120
click to vote
RAS
2008
15 years 3 months ago
2008
This paper presents a cooperative decentralized path-planning algorithm for a group of autonomous agents that provides guaranteed collisionfree trajectories in real-time. The algo...
119
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
In this paper we will present the two basic operations for database schemas used in database mapping systems (separation and Data Federation), and we will explain why the functoria...
134
click to vote
STOC
1989
ACM
15 years 8 months ago
1989
ACM
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
139
click to vote
SAGT
2009
Springer
15 years 10 months ago
2009
Springer
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...