1971 search results - page 173 / 395 » Tabu search - Uncharted domains |
170
click to vote
AIPS
2006
15 years 7 months ago
2006
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
160
click to vote
AIPS
2000
15 years 7 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
151
click to vote
AIM
2004
15 years 6 months ago
2004
Satellite domains are becoming a fashionable area of research within the AI community due to the complexity of the problems that these domains need to solve. With the current US a...
153
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Despite the success of web search engines, search over large enterprise intranets still suffers from poor result quality. Earlier work [6] that compared intranets and the Internet...
205
click to vote
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
In many Web applications, such as blog classification and newsgroup classification, labeled data are in short supply. It often happens that obtaining labeled data in a new domain ...