4342 search results - page 183 / 869 » Improved Algorithms for Optimal Embeddings |
155
click to vote
CEC
2010
IEEE
15 years 5 months ago
2010
IEEE
This paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP). The first phase is based on a sequence based genetic algorithm (SBGA) with an embedded lo...
145
click to vote
SIAMCOMP
2010
14 years 11 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
122
Voted
COCOON
2007
Springer
15 years 11 months ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
145
click to vote
ECRTS
2006
IEEE
15 years 10 months ago
2006
IEEE
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...
150
click to vote
HIPEAC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Iterative optimization has become a popular technique to obtain improvements over the default settings in a compiler for performance-critical applications, such as embedd...