Sciweavers

13621 search results - page 2640 / 2725
» Computability and Complexity in Self-assembly
Sort
View
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 5 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...
111
Voted
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
15 years 5 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
111
Voted
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 5 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
117
Voted
CEC
2009
IEEE
15 years 5 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
125
Voted
SAC
2009
ACM
15 years 5 months ago
Towards "WYDIWYS" for MIMI using concept analysis
This paper presents a novel software engineering approach for developing a dynamic web interface that meets the quality criterion of “WYDIWYS” - What You Do Is What You See. T...
Jie Dai, Remo Mueller, Jacek Szymanski, Guo-Qiang ...
« Prev « First page 2640 / 2725 Last » Next »