Sciweavers

2926 search results - page 161 / 586
» Partially Optimal Routing
Sort
View
KES
2000
Springer
15 years 10 months ago
Knowledge based genetic algorithm for dynamic route selection
This paper addresses the problem of selecting route to a given destination on a load map under a dynamic environment. The proposed solution is using a genetic algorithm adopting v...
Hitoshi Kanoh, Tomohiro Nakamura
ASPDAC
2005
ACM
91views Hardware» more  ASPDAC 2005»
15 years 8 months ago
A Min-area Solution to Performance and RLC Crosstalk Driven Global Routing Problem
-- This paper presents a novel global routing algorithm, AT-PO-GR, to minimize the routing area under both congestion, timing, and RLC crosstalk constraints. The proposed algorithm...
Tong Jing, Ling Zhang, Jinghong Liang, Jingyu Xu, ...
NETWORKS
2010
15 years 5 months ago
Optical index of fault tolerant routings in WDM networks
Maˇnuch and Stacho [7] introduced the problem of designing f-tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur...
Stéphane Bessy, Clément Lepelletier
DCC
2008
IEEE
16 years 6 months ago
Huffman Coding with Non-sorted Frequencies
Abstract. A standard way of implementing Huffman's optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are inves...
Shmuel Tomi Klein, Dana Shapira
IFIP
1994
Springer
15 years 11 months ago
Evolving Algebras
We describe the architecture of an evolving algebra partial evaluator, a program which specializes an evolving algebra with respect to a portion of its input. We discuss the parti...
Yuri Gurevich