1331 search results - page 163 / 267 » Complexity bounds for zero-test algorithms |
131
click to vote
GECCO
2008
Springer
15 years 4 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...
132
click to vote
IPPS
2009
IEEE
15 years 9 months ago
2009
IEEE
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
193
click to vote
CSCLP
2008
Springer
15 years 4 months ago
2008
Springer
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...
147
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
—A unified analytical framework for optimum power allocation in the unordered V-BLAST algorithm and its comparative performance analysis are presented. Compact closed-form appro...
134
click to vote
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...