1041 search results - page 49 / 209 » Randomizing Reductions of Search Problems |
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
IBERAMIA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
TSMC
1998
13 years 7 months ago
1998
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
TSP
2008
13 years 8 months ago
2008
We consider the problem of estimating and detecting sparse signals over a large area of an image or other medium. We introduce a novel cost function that captures the tradeoff bet...
CEC
2010
IEEE
13 years 9 months ago
2010
IEEE
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Prob...