Sciweavers

185 search results - page 9 / 37
» Discrete online TSP
Sort
View
COCOA
2008
Springer
13 years 9 months ago
Stochastic Online Scheduling Revisited
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
Andreas S. Schulz
TSP
2008
151views more  TSP 2008»
13 years 7 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
TSP
2008
154views more  TSP 2008»
13 years 7 months ago
Algebraic Signal Processing Theory: 1-D Space
In our paper titled "Algebraic Signal Processing Theory: Foundation and 1-D Time" appearing in this issue of the IEEE TRANSACTIONS ON SIGNAL PROCESSING, we presented the ...
Markus Püschel, José M. F. Moura
ICRA
2009
IEEE
117views Robotics» more  ICRA 2009»
13 years 5 months ago
Temporal stabilization of discrete movement in variable environments: An attractor dynamics approach
The ability to generate discrete movement with distinct and stable time courses is important for interaction scenarios both between different robots and with human partners, for ca...
Matthias Tuma, Ioannis Iossifidis, Gregor Schö...
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
14 years 1 months ago
Genetic multi-step search in interpolation and extrapolation domain
The deterministic Multi-step Crossover Fusion (dMSXF) is an improved crossover method of MSXF which is a promising method of JSP, and it shows high availability in TSP. Both of th...
Yoshiko Hanada, Tomoyuki Hiroyasu, Mitsunori Miki