5316 search results - page 38 / 1064 » Which Search Problems Are Random |
128
Voted
FOCS
2008
IEEE
15 years 1 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g., locating binding sites and regulatory signals, and designing genetic prob...
118
Voted
KDD
2010
ACM
15 years 4 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
SAT
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
AIPS
2006
15 years 2 months ago
2006
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...