Sciweavers

597 search results - page 31 / 120
» Homomorphisms of random paths
Sort
View
DATE
2005
IEEE
107views Hardware» more  DATE 2005»
15 years 3 months ago
On Statistical Timing Analysis with Inter- and Intra-Die Variations
In this paper, we highlight a fast, effective and practical statistical approach that deals with inter and intra-die variations in VLSI chips. Our methodology is applied to a numb...
Hratch Mangassarian, Mohab Anis
78
Voted
WSC
2004
14 years 11 months ago
Efficient Pricing of Barrier Options with the Variance-Gamma Model
We develop an efficient Monte Carlo algorithm for pricing barrier options with the variance gamma model (Madan, Carr, and Chang 1998). After generalizing the double-gamma bridge s...
Athanassios N. Avramidis
VLSID
2000
IEEE
94views VLSI» more  VLSID 2000»
15 years 2 months ago
A Genetic Algorithm for the Synthesis of Structured Data Paths
The technique presented here achieves simultaneous optimization of schedule time and data path component cost within a structured data path architecture, using a genetic algorithm...
Chittaranjan A. Mandal, R. M. Zimmer
86
Voted
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 3 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
ICDCS
2012
IEEE
13 years 2 days ago
DARD: Distributed Adaptive Routing for Datacenter Networks
Datacenter networks typically have many paths connecting each host pair to achieve high bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection ban...
Xin Wu, Xiaowei Yang