Sciweavers

2957 search results - page 483 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
DATE
2007
IEEE
102views Hardware» more  DATE 2007»
14 years 2 months ago
Efficient testbench code synthesis for a hardware emulator system
: - The rising complexity of modern embedded systems is causing a significant increase in the verification effort required by hardware designers and software developers, leading to...
Ioannis Mavroidis, Ioannis Papaefstathiou
DATE
2007
IEEE
150views Hardware» more  DATE 2007»
14 years 2 months ago
Fast memory footprint estimation based on maximal dependency vector calculation
In data dominated applications, loop transformations have a huge impact on the lifetime of array data and therefore on memory footprint. Since a locally optimal loop transformatio...
Qubo Hu, Arnout Vandecappelle, Per Gunnar Kjeldsbe...
GLOBECOM
2007
IEEE
14 years 2 months ago
Heuristics for the Design and Optimization of Streaming Content Distribution Networks
Abstract— The design of efficient and scalable streaming Content Distribution Networks (CDNs) is an open problem of great economic interest. A key decision is the number of repl...
Sandjai Bhulai, Robert D. van der Mei, Mengxiao Wu
HICSS
2007
IEEE
141views Biometrics» more  HICSS 2007»
14 years 2 months ago
Second-Best Combinatorial Auctions - The Case of the Pricing-Per-Column Mechanism
One of the main contributions of classical mechanism design is the derivation of the Groves mechanisms. The class of Groves mechanisms are the only mechanisms that are strategy-pr...
Dirk Neumann, Björn Schnizler, Ilka Weber, Ch...
ICC
2007
IEEE
120views Communications» more  ICC 2007»
14 years 2 months ago
On the Tails of the Distribution of the Sum of Lognormals
—Finding the distribution of the sum of lognormal We assume in this paper that the terms Yi are independent. The random variables is an important mathematical problem in probabil...
Sebastien S. Szyszkowicz, Halim Yanikomeroglu