1139 search results - page 89 / 228 » Bounded Ideation Theory |
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
ICCV
2003
IEEE
14 years 11 months ago
2003
IEEE
This paper describes a novel application of Statistical Learning Theory (SLT) to control model complexity in flow estimation. SLT provides analytical generalization bounds suitabl...
DCC
2009
IEEE
14 years 9 months ago
2009
IEEE
An analysis is presented that extends existing Rayleigh-Ritz theory to the special case of highly eccentric distributions. Specifically, a bound on the angle between the first Rit...
CADE
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...