1529 search results - page 120 / 306 » Search Space Analysis of the Linear Ordering Problem |
140
click to vote
ECAI
2004
Springer
15 years 9 months ago
2004
Springer
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
148
Voted
LPNMR
2004
Springer
15 years 9 months ago
2004
Springer
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search h...
118
Voted
IWANN
1995
Springer
15 years 7 months ago
1995
Springer
This paper presents a comparative analysis of neural networks, simulated annealing, and genetic algorithms in the determination of input patterns for testing analog circuits. The ...
139
click to vote
IJCAI
2007
15 years 5 months ago
2007
We introduce a new technique for counting models of Boolean satisfiability problems. Our approach incorporates information obtained from sampling the solution space. Unlike previ...
157
click to vote
EOR
2006
15 years 4 months ago
2006
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...