34170 search results - page 237 / 6834 » Optimization |
133
click to vote
OL
2010
15 years 2 months ago
2010
We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1, . . . , m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the funct...
122
click to vote
SIAMDM
2010
15 years 2 months ago
2010
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
134
click to vote
SWARM
2010
SPRINGER
15 years 2 months ago
2010
SPRINGER
Abstract. Inspired by observing fireworks explosion, a novel swarm intelligence algorithm, called Fireworks Algorithm (FA), is proposed for global optimization of complex function...
174
click to vote
WIOPT
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...
147
click to vote
ICCAD
2010
IEEE
15 years 2 months ago
2010
IEEE
For a variety of signal processing applications polynomials are implemented in circuits. Recent work on polynomial datapath optimization achieved significant reductions of hardware...