Sciweavers

4781 search results - page 882 / 957
» Complexity at large
Sort
View
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
14 years 1 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
14 years 1 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...
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
14 years 1 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»
14 years 1 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
ICSE
2010
IEEE-ACM
14 years 1 months ago
A methodology to support load test analysis
Performance analysts rely heavily on load testing to measure the performance of their applications under a given load. During the load test, analyst strictly monitor and record th...
Haroon Malik