3946 search results - page 719 / 790 » The computational complexity of choice sets |
202
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
192
click to vote
IICAI
2007
15 years 7 months ago
2007
Logics of action, for reasoning about the effects of state change, and logics of belief, accounting for belief revision and update, have much in common. Furthermore, we may underta...
205
click to vote
UAI
2008
15 years 7 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
158
click to vote
AAAI
2004
15 years 7 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
199
click to vote
SDM
2003
SIAM
15 years 7 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...