16091 search results - page 447 / 3219 » Solving |
192
click to vote
IJCAI
2003
15 years 8 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
184
click to vote
IJCAI
2003
15 years 8 months ago
2003
Traditional single-agent search algorithms usually make simplifying assumptions (single search agent, stationary target, complete knowledge of the state, and sufficient time). The...
155
click to vote
UAI
2004
15 years 8 months ago
2004
Within the task of collaborative filtering two challenges for computing conditional probabilities exist. First, the amount of training data available is typically sparse with resp...
157
click to vote
NAACL
2003
15 years 8 months ago
2003
Homograph ambiguity is an original issue in Text-to-Speech (TTS). To disambiguate homograph, several efficient approaches have been proposed such as part-of-speech (POS) n-gram, B...
169
click to vote
NIPS
2003
15 years 8 months ago
2003
Approximate linear programming (ALP) has emerged recently as one of the most promising methods for solving complex factored MDPs with finite state spaces. In this work we show th...