Sciweavers

16088 search results - page 363 / 3218
» A Mean-Variance Optimization algorithm
Sort
View
STACS
2004
Springer
16 years 18 days ago
Optimal and Online Preemptive Scheduling on Uniformly Related Machines
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
Tomás Ebenlendr, Jiri Sgall
IPPS
2002
IEEE
16 years 6 days ago
Concept-Based Component Libraries and Optimizing Compilers
This paper discusses concept lattices and some of their applications in component library development and compiler optimizations. Ongoing work on concept-based userextensible simp...
Sibylle Schupp, D. P. Gregor, B. Osman, David R. M...
ACID
2006
264views Algorithms» more  ACID 2006»
15 years 8 months ago
A Parameterized View on Matroid Optimization Problems
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
Dániel Marx
JSAC
2006
63views more  JSAC 2006»
15 years 7 months ago
Multicarrier multiple access is sum-rate optimal for block transmissions over circulant ISI channels
Abstract--Multicarrier multiple access with channel knowledge and prescribed power at the transmitters is shown to maximize the sum-rate for circulant intersymbol-interference (ISI...
Shuichi Ohno, Georgios B. Giannakis, Zhi-Quan Luo
IJSIR
2010
122views more  IJSIR 2010»
15 years 2 months ago
Biases in Particle Swarm Optimization
It is known that the most common versions of particle swarm optimization (PSO) algorithms are rotationally variant. It has also been pointed out that PSO algorithms can concentrat...
William M. Spears, Derek T. Green, Diana F. Spears