1930 search results - page 372 / 386 » Learning to Solve QBF |
CCO
2001
Springer
14 years 5 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
SIGADA
2001
Springer
14 years 3 days ago
2001
Springer
Statement and AbstractProblem Statement and AbstractProblem Statement and AbstractProblem Statement and Abstract The U.S. Navy currently bases the majority of our contact managemen...
WABI
2001
Springer
14 years 3 days ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
SIGCSE
2000
ACM
14 years 1 days ago
2000
ACM
Empirical skills are playing an increasingly important role in the computing profession and our society. But while traditional computer science curricula are effective in teaching...
ASIACRYPT
2000
Springer
14 years 23 hour ago
2000
Springer
We consider a problem which was stated in a request for comments made by NIST in the FIPS97 document. The question is the following: Can we have a digital signature public key infr...