5316 search results - page 324 / 1064 » Which Search Problems Are Random |
172
click to vote
DATE
2005
IEEE
16 years 20 days ago
2005
IEEE
In this paper we present arithmetic real-coded variation operators tailored for time slot and turn optimization on TDMA-scheduled resources with evolutionary algorithms. Our opera...
174
click to vote
ICPP
1999
IEEE
15 years 11 months ago
1999
IEEE
We study the problem of exploiting parallelism from search-based AI systems on distributed machines. We propose stack-splitting, a technique for implementing orparallelism, which ...
174
click to vote
NIPS
2007
15 years 8 months ago
2007
Can we leverage learning techniques to build a fast nearest-neighbor (ANN) retrieval data structure? We present a general learning framework for the NN problem in which sample que...
169
click to vote
ICPR
2002
IEEE
16 years 8 months ago
2002
IEEE
A heretofore unsolved problem of great archaeological importance is the automatic assembly of pots made on a wheel from the hundreds (or thousands) of sherds found at an excavatio...
214
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...