2343 search results - page 43 / 469 » Visual-Concept Search Solved |
105
Voted
ICTAI
1999
IEEE
15 years 5 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
159
Voted
IJCAI
1989
15 years 2 months ago
1989
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
125
Voted
SIGMOD
2012
ACM
13 years 3 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
104
Voted
AIPS
2006
15 years 2 months ago
2006
Planning is often not a one-shot task because either the world or the agent's knowledge of the world changes. In this paper, we introduce a new principle that can be used to ...
87
Voted
BIRTHDAY
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Heuristic programming was the first area in which AI methods were tested. The favourite case-studies were fairly simple toyproblems, such as cryptarithmetic, games, such ...