127 search results - page 21 / 26 » Measuring the Hardness of SAT Instances |
MIDDLEWARE
2007
Springer
14 years 1 months ago
2007
Springer
Unpredictability in COTS-based systems often manifests as occasional instances of uncontrollably-high response times. A particular category of COTS systems, fault-tolerant (FT) mid...
IMC
2010
ACM
13 years 5 months ago
2010
ACM
Network tomography establishes linear relationships between the characteristics of individual links and those of end-toend paths. It has been proved that these relationships can b...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
This contribution is the first to discover exploitable structural features within circuit optimization problems (COP) and discuss how it is indicative of a general structure and ...
GECCO
2005
Springer
14 years 28 days ago
2005
Springer
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
ECAI
2004
Springer
14 years 24 days ago
2004
Springer
The standard SVM formulation for binary classification is based on the Hinge loss function, where errors are considered not correlated. Due to this, local information in the featu...