Sciweavers

1542 search results - page 246 / 309
» A Qos Routing Algorithm Based on Ant Algorithm
Sort
View
128
Voted
COCOON
2006
Springer
15 years 6 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
TCAD
2008
133views more  TCAD 2008»
15 years 2 months ago
Metal-Density-Driven Placement for CMP Variation and Routability
In this paper, we propose the first metal-density driven placement algorithm to reduce CMP variation and achieve higher routability. Based on an analytical placement framework, we...
Tung-Chieh Chen, Minsik Cho, David Z. Pan, Yao-Wen...
123
Voted
TCS
2008
15 years 2 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous
IJAIT
2010
167views more  IJAIT 2010»
15 years 1 months ago
Bee Colony Optimization with Local Search for Traveling Salesman Problem
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
Li-Pei Wong, Malcolm Yoke-Hean Low, Chin Soon Chon...
126
Voted
NOMS
2010
IEEE
173views Communications» more  NOMS 2010»
15 years 1 months ago
Dynamic resource allocation and power management in virtualized data centers
—We investigate optimal resource allocation and power management in virtualized data centers with time-varying workloads and heterogeneous applications. Prior work in this area u...
Rahul Urgaonkar, Ulas C. Kozat, Ken Igarashi, Mich...