Sciweavers

31 search results - page 5 / 7
» Pseudo-Boolean optimization
Sort
View
TCS
2010
13 years 5 months ago
Runtime analysis of a binary particle swarm optimizer
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles sear...
Dirk Sudholt, Carsten Witt
NOMS
2008
IEEE
14 years 1 months ago
Towards SLA-based optimal workload distribution in SANs
—Storage Area Networks (SANs) connect storage devices to servers over fast network interconnects. We consider the problem of optimal SAN configuration with the goal of meeting s...
Eray Gencay, Carsten Sinz, Wolfgang Küchlin
DATE
2008
IEEE
142views Hardware» more  DATE 2008»
13 years 9 months ago
Algorithms for Maximum Satisfiability using Unsatisfiable Cores
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
João Marques-Silva, Jordi Planes
CHES
2010
Springer
166views Cryptology» more  CHES 2010»
13 years 8 months ago
Algebraic Side-Channel Analysis in the Presence of Errors
Measurement errors make power analysis attacks difficult to mount when only a single power trace is available: the statistical methods that make DPA attacks so successful are not a...
Yossef Oren, Mario Kirschbaum, Thomas Popp, Avisha...
ICCV
2009
IEEE
14 years 10 months ago
The Swap and Expansion Moves Revisited and Fused
Many solutions to computer vision and image processing problems involve the minimization of multi-label energy functions with up to K variables in each term. In the minimization pr...
Ido Leichter