Sciweavers

4342 search results - page 202 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
IPPS
1997
IEEE
15 years 9 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
15 years 9 months ago
New On-Line Algorithms for the Page Replication Problem
We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitiv...
Susanne Albers, Hisashi Koga
CASES
2005
ACM
15 years 6 months ago
A post-compilation register reassignment technique for improving hamming distance code compression
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
Montserrat Ros, Peter Sutton
GECCO
2003
Springer
116views Optimization» more  GECCO 2003»
15 years 10 months ago
A Hybrid Genetic Algorithm Based on Complete Graph Representation for the Sequential Ordering Problem
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment an...
Dong-il Seo, Byung Ro Moon
ICIC
2007
Springer
15 years 11 months ago
On the Convergence Properties of Quantum-Inspired Multi-Objective Evolutionary Algorithms
Abstract. In this paper, a general framework of quantum-inspired multiobjective evolutionary algorithms is proposed based on the basic principles of quantum computing and general s...
Zhiyong Li, Zhe Li, Günter Rudolph