Sciweavers

1768 search results - page 272 / 354
» Optimal routing in Chord
Sort
View
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
15 years 3 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
JSAC
2007
121views more  JSAC 2007»
15 years 1 months ago
Spare Capacity Allocation in Two-Layer Networks
Abstract— In this paper we consider the problem of provisioning spare capacity in two-layer backbone networks using shared backup path protection. First, two spare capacity alloc...
Yu Liu, David Tipper, K. Vajanapoom
AEI
1999
120views more  AEI 1999»
15 years 1 months ago
Genetic algorithms for designing multihop lightwave network topologies
Multihop lightwave networks are a means of utilizing the large bandwidth of optical fibers. In these networks, each node has a fixed number of transmitters and receivers connected...
Cenk Gazen, Cem Ersoy
132
Voted
PPSN
2010
Springer
15 years 2 days ago
Improved Dynamic Lexicographic Ordering for Multi-Objective Optimisation
Abstract. There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. esta...
Juan Pedro Castro Gutiérrez, Dario Landa-Si...
ICCAD
2003
IEEE
109views Hardware» more  ICCAD 2003»
15 years 10 months ago
Large-Scale Circuit Placement: Gap and Promise
Placement is one of the most important steps in the RTLto-GDSII synthesis process, as it directly defines the interconnects, which have become the bottleneck in circuit and syste...
Jason Cong, Tim Kong, Joseph R. Shinnerl, Min Xie,...