5316 search results - page 303 / 1064 » Which Search Problems Are Random |
152
click to vote
PKDD
2009
Springer
16 years 21 days ago
2009
Springer
Web searches tend to be short and ambiguous. It is therefore not surprising that Web query disambiguation is an actively researched topic. To provide a personalized experience for ...
146
click to vote
AI
2003
Springer
15 years 11 months ago
2003
Springer
The multi-processor total tardiness problem (MPTTP) is an ÆÈ-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a numb...
164
Voted
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
183
click to vote
AAAI
2007
15 years 8 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
174
Voted
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...