4488 search results - page 111 / 898 » Focusing Search by Using Problem Solving Experience |
141
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
121
click to vote
CP
2008
Springer
15 years 5 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
136
Voted
IJCNN
2006
IEEE
15 years 9 months ago
2006
IEEE
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
136
click to vote
KER
2007
15 years 3 months ago
2007
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
116
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...