Sciweavers

366 search results - page 7 / 74
» A new model for selfish routing
Sort
View
88
Voted
ICCAD
2000
IEEE
91views Hardware» more  ICCAD 2000»
15 years 1 months ago
A Timing-Constrained Algorithm for Simultaneous Global Routing of Multiple Nets
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
Jiang Hu, Sachin S. Sapatnekar
CCS
2011
ACM
13 years 9 months ago
Trust-based anonymous communication: adversary models and routing algorithms
We introduce a novel model of routing security that incorporates the ordinarily overlooked variations in trust that users have for different parts of the network. We focus on ano...
Aaron Johnson, Paul F. Syverson, Roger Dingledine,...
MP
2006
138views more  MP 2006»
14 years 9 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...
126
Voted
WWIC
2007
Springer
247views Communications» more  WWIC 2007»
15 years 3 months ago
Reliable Geographical Multicast Routing in Vehicular Ad-Hoc Networks
Vehicular ad-hoc networks (VANETs) offer a large number of new potential applications without relying on significant infrastructure. Many of these applications benefit from multi-h...
Maria Kihl, Mihail L. Sichitiu, Ted Ekeroth, Micha...
BMCBI
2006
155views more  BMCBI 2006»
14 years 9 months ago
CAVER: a new tool to explore routes from protein clefts, pockets and cavities
Background: The main aim of this study was to develop and implement an algorithm for the rapid, accurate and automated identification of paths leading from buried protein clefts, ...
Martin Petrek, Michal Otyepka, Pavel Banás,...