400 search results - page 21 / 80 » What Makes a Problem GP-Hard |
CP
2010
Springer
13 years 6 months ago
2010
Springer
The automatic tuning of the parameters of algorithms and automatic selection of algorithms has received a lot of attention recently. One possible approach is the use of machine lea...
ASPDAC
2004
ACM
14 years 1 months ago
2004
ACM
Many important tasks in circuit design and verification can be performed in practice via reductions to Boolean Satisfiability (SAT), making SAT a fundamental EDA problem. However ...
DGCI
2003
Springer
14 years 1 months ago
2003
Springer
In order to make image analysis methods more reliable it is important to analyse to what extend shape information is preserved during image digitization. Most existing approaches t...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Designing an adequate fitness function requiressubstantial knowledge of a problem and of features that indicate progress towards a solution. Coevolution takes the human ...
EUROCRYPT
2006
Springer
14 years 5 days ago
2006
Springer
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...