1429 search results - page 188 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
EMSOFT
2010
Springer
13 years 7 months ago
2010
Springer
Variable-bandwidth servers (VBS) control process execution speed by allocating variable CPU bandwidth to processes. VBS enables temporal isolation of EDF-scheduled processes in th...
COMPGEOM
2008
ACM
13 years 10 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. The performance of RKDA depends on the selection o...
ICRA
2009
IEEE
14 years 3 months ago
2009
IEEE
— In this paper, we propose a path planning method for nonholonomic multi-vehicle system in presence of moving obstacles. The objective is to find multiple fixed length paths f...
ISNN
2009
Springer
14 years 3 months ago
2009
Springer
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...