24 search results - page 1 / 5 » Finding Crucial Subproblems to Focus Global Search |
ICTAI
2006
IEEE
13 years 10 months ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
ISMB
2000
13 years 6 months ago
2000
Understanding the mechanismsthat determine the regulation of geneexpression is an important and challenging problem. A fundamental subproblem is to identify DNA-bindingsites for u...
SIGIR
2011
ACM
2011
ACM
Find it if you can: a game for modeling different types of web search success using interaction data
12 years 7 months ago
A better understanding of strategies and behavior of successful searchers is crucial for improving the experience of all searchers. However, research of search behavior has been s...
ICDE
2010
IEEE
13 years 10 months ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
RECOMB
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...