4266 search results - page 290 / 854 » Search for More Declarativity |
168
click to vote
IJCAI
2003
15 years 8 months ago
2003
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...
177
click to vote
UAI
2004
15 years 8 months ago
2004
In recent years, there is a growing interest in learning Bayesian networks with continuous variables. Learning the structure of such networks is a computationally expensive proced...
211
click to vote
ISMB
2000
15 years 8 months ago
2000
Position-specific scoring matrices have been used extensively to recognize highly conserved protein regions. We present a method for accelerating these searches using a suffix tre...
189
click to vote
AAAI
1994
15 years 8 months ago
1994
Techniques that traditionally have been useful for retrieving same-domain analogies from small single-use knowledge bases, such as spreading activation and indexing on selected fe...
175
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...