477 search results - page 83 / 96 » Complexity Considerations, cSAT Problem Lower Bound |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Dynamic real-time systems require adaptive resource management to accommodate varying processing needs. We address the problem of resource management with multiple shared resource...
ALENEX
2010
13 years 9 months ago
2010
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...