Sciweavers

220 search results - page 22 / 44
» Minimizing Average Flow-time : Upper and Lower Bounds
Sort
View
CODES
2006
IEEE
14 years 1 months ago
Bounded arbitration algorithm for QoS-supported on-chip communication
Time-critical multi-processor systems require guaranteed services in terms of throughput, bandwidth etc. in order to comply to hard real-time constraints. However, guaranteedservi...
Mohammad Abdullah Al Faruque, Gereon Weiss, Jö...
AUTOMATICA
2005
152views more  AUTOMATICA 2005»
13 years 7 months ago
Identification of dynamical systems with a robust interval fuzzy model
In this paper we present a new method of interval fuzzy model identification. The method combines a fuzzy identification methodology with some ideas from linear programming theory...
Igor Skrjanc, Saso Blazic, Osvaldo E. Agamennoni
UAI
1998
13 years 8 months ago
Large Deviation Methods for Approximate Probabilistic Inference
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr childjparents depend monotonically on weighted sums of the parents. In larg...
Michael J. Kearns, Lawrence K. Saul
ICCAD
1997
IEEE
118views Hardware» more  ICCAD 1997»
13 years 11 months ago
Global interconnect sizing and spacing with consideration of coupling capacitance
This paper presents an efficient approach to perform global interconnect sizing and spacing (GISS) for multiple nets to minimize interconnect delays with consideration of couplin...
Jason Cong, Lei He, Cheng-Kok Koh, David Zhigang P...
TIT
2008
72views more  TIT 2008»
13 years 7 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski