Sciweavers

13603 search results - page 2657 / 2721
» On the Complexity of Computing Treelength
Sort
View
MICRO
2002
IEEE
143views Hardware» more  MICRO 2002»
15 years 10 months ago
Effective instruction scheduling techniques for an interleaved cache clustered VLIW processor
Clustering is a common technique to overcome the wire delay problem incurred by the evolution of technology. Fully-distributed architectures, where the register file, the functio...
Enric Gibert, F. Jesús Sánchez, Anto...
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 10 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
155
Voted
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
15 years 10 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 10 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
CEC
2009
IEEE
15 years 10 months ago
Memetic algorithm with Local search chaining for large scale continuous optimization problems
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
Daniel Molina, Manuel Lozano, Francisco Herrera
« Prev « First page 2657 / 2721 Last » Next »