3946 search results - page 672 / 790 » The computational complexity of choice sets |
162
click to vote
AIPS
2010
15 years 8 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
191
click to vote
AAAI
2007
15 years 8 months ago
2007
Complex networks exist in a wide array of diverse domains, ranging from biology, sociology, and computer science. These real-world networks, while disparate in nature, often compr...
173
click to vote
AIPS
2007
15 years 8 months ago
2007
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
186
click to vote
WSC
2008
15 years 8 months ago
2008
Recent research has shown that while many complex networks follow a power-law distribution for their node degrees, it is not sufficient to model these networks based only on their...
200
click to vote
EDBT
2010
ACM
15 years 8 months ago
2010
ACM
Keyword-based search in relational databases allows users to discover relevant information without knowing the database schema or using complicated queries. However, such searches...