1186 search results - page 135 / 238 » Improving Random Walk Performance |
136
click to vote
AAAI
1996
15 years 3 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
138
click to vote
SIGIR
2008
ACM
15 years 2 months ago
2008
ACM
This paper addresses the issue of query refinement, which involves reformulating ill-formed search queries in order to enhance relevance of search results. Query refinement typica...
241
click to vote
WEA
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuit – as measured ...
137
click to vote
EWCBR
2006
Springer
15 years 6 months ago
2006
Springer
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...
124
click to vote
RECOMB
2007
Springer
16 years 2 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...