Sciweavers

708 search results - page 12 / 142
» Timing closure: the solution and its problems
Sort
View
ESA
2009
Springer
143views Algorithms» more  ESA 2009»
15 years 4 months ago
On Optimally Partitioning a Text to Improve Its Compression
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
Paolo Ferragina, Igor Nitto, Rossano Venturini
VTC
2006
IEEE
118views Communications» more  VTC 2006»
15 years 3 months ago
A Space-Time based Approach to Solving the Gain Asymmetry in MIMO ad hoc Networks
— The problem of gain asymmetry in MIMO ad-hoc networks is outlined and the solutions proposed in literature are surveyed. The protocol in [1] approach is analyzed and its delay ...
Francesco Rossetto, Michele Zorzi
EVOW
2005
Springer
15 years 3 months ago
Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem
This paper presents the Scatter Search Particle Filter (SSPF) algorithm and its application to the Dynamic Travelling Salesman Problem (DTSP). SSPF combines sequential estimation a...
Juan José Pantrigo, Abraham Duarte, Á...
SIGMETRICS
2002
ACM
142views Hardware» more  SIGMETRICS 2002»
14 years 9 months ago
Exact aggregate solutions for M/G/1-type Markov processes
We introduce a new methodology for the exact analysis of M/G/1-type Markov processes. The methodology uses basic, well-known results for Markov chains by exploiting the structure ...
Alma Riska, Evgenia Smirni
ASPDAC
2006
ACM
176views Hardware» more  ASPDAC 2006»
15 years 1 months ago
Closed form solution for optimal buffer sizing using the Weierstrass elliptic function
Abstract-- This paper presents a fundamental result on buffer sizing. Given an interconnection wire with n buffers evenly spaced along the wire, we would like to size all buffers s...
Sebastian Vogel, Martin D. F. Wong