Sciweavers

43 search results - page 6 / 9
» On the vertices of the k-additive core
Sort
View
CN
2008
108views more  CN 2008»
13 years 7 months ago
Finding a dense-core in Jellyfish graphs
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool
TON
2008
119views more  TON 2008»
13 years 7 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
13 years 11 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
ASPDAC
2006
ACM
153views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Diagonal routing in high performance microprocessor design
This paper presents a diagonal routing method which is applied to an actual microprocessor prototype chip. While including the layout functions for the conventional Manhattan rout...
Noriyuki Ito, Hideaki Katagiri, Ryoichi Yamashita,...
HICSS
2005
IEEE
114views Biometrics» more  HICSS 2005»
14 years 1 months ago
Delta Changes for OO Software Adaptation: Pervasive or Invasive?
The ability for software products to adapt to future changes is essential. Whether the change, the delta, is prefixed to subclasses or postfixed to super classes, class hierarchie...
Atef Bader, Shangping Ren, Husein Armouti