9842 search results - page 1678 / 1969 » Problem complexity |
194
Voted
NAACL
2001
15 years 8 months ago
2001
Developing dialogue systems is a complex process. In particular, designing efficient dialogue management strategies is often difficult as there are no precise guidelines to develo...
137
click to vote
OPODIS
2004
15 years 8 months ago
2004
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
179
click to vote
NIPS
2001
15 years 8 months ago
2001
Probabilistic mixture models are used for a broad range of data analysis tasks such as clustering, classification, predictive modeling, etc. Due to their inherent probabilistic na...
182
click to vote
UAI
2001
15 years 8 months ago
2001
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
190
click to vote
IJCAI
2003
15 years 8 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...