16666 search results - page 2914 / 3334 » Descriptive and Computational Complexity |
175
click to vote
AAAI
2004
15 years 8 months ago
2004
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
166
click to vote
AAAI
2006
15 years 8 months ago
2006
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
179
click to vote
AAAI
2006
15 years 8 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
171
click to vote
ACE
2004
15 years 8 months ago
2004
The issues surrounding curriculum design of many Computer Science and Software Engineering degree programs1 are many and complex. In particular, the question of whether prior prog...
187
click to vote
AAAI
2006
15 years 8 months ago
2006
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...