2343 search results - page 24 / 469 » Visual-Concept Search Solved |
CP
2005
Springer
15 years 6 months ago
2005
Springer
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solu...
EUROCRYPT
2000
Springer
15 years 4 months ago
2000
Springer
The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard ove...
115
Voted
CP
2007
Springer
15 years 7 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
128
click to vote
ICCAD
1997
IEEE
15 years 5 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
SAT
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Polynomial interpretations are one of the most popular techniques for automated termination analysis and the search for such interpretations is a main bottleneck in most ...