1985 search results - page 28 / 397 » A Minimal Periods Algorithm with Applications |
159
Voted
EVOW
2011
Springer
2011
Springer
Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows
14 years 6 months ago
The traveling salesman problem with time windows is known to be a really difficult benchmark for optimization algorithms. In this paper, we are interested in the minimization of th...
144
click to vote
ICIAR
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In this article we present the results of an unsupervised segmentation algorithm based on a multiresolution method. The algorithm uses color and edge information in an it...
109
click to vote
JEC
2006
15 years 3 months ago
2006
The set of frames exchanged in automotive applications must meet two constraints: it has to be feasible from a schedulability point of view and it should minimize the network bandw...
119
click to vote
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average of the leaves’ depths, it minimizes the maximum of any leaf’s weight plus i...
140
click to vote
EMSOFT
2011
Springer
14 years 3 months ago
2011
Springer
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...