7978 search results - page 575 / 1596 » Combining shared-coin algorithms |
181
click to vote
IJCAI
2001
15 years 8 months ago
2001
Recent research has addressed the problem of planning in non-deterministic domains. Classical planning has also been extended to the case of goals that can express temporal proper...
186
click to vote
NIPS
2004
15 years 8 months ago
2004
We present an algorithm to perform blind, one-microphone speech separation. Our algorithm separates mixtures of speech without modeling individual speakers. Instead, we formulate ...
157
click to vote
NIPS
2004
15 years 8 months ago
2004
We present an algorithm to overcome the local maxima problem in estimating the parameters of mixture models. It combines existing approaches from both EM and a robust fitting algo...
160
click to vote
IJCAI
2003
15 years 8 months ago
2003
Markov decision processes (MDPs) and contingency planning (CP) are two widely used approaches to planning under uncertainty. MDPs are attractive because the model is extremely gen...
155
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...