2412 search results - page 66 / 483 » Which Problems Have Strongly Exponential Complexity |
SIGECOM
2011
ACM
13 years 2 months ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
SIGECOM
2008
ACM
13 years 11 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
NIPS
2001
14 years 16 days ago
2001
Support Vector Machines (SVMs) are currently the state-of-the-art models for many classication problems but they suer from the complexity of their training algorithm which is at l...
ICML
2005
IEEE
14 years 12 months ago
2005
IEEE
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...
ICGI
2010
Springer
13 years 9 months ago
2010
Springer
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...