Sciweavers

400 search results - page 43 / 80
» Lower Bounds Using Kolmogorov Complexity
Sort
View
JSAC
2010
92views more  JSAC 2010»
13 years 8 months ago
Analysis of Nonlinear Transition Shift and Write Precompensation in Perpendicular Recording Systems
Abstract—In high density perpendicular magnetic recording channels, nonlinear transition shift (NLTS) is one of the distortions that can degrade the system performance. Write pre...
Zheng Wu, Paul H. Siegel, Jack K. Wolf, H. Neal Be...
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
14 years 3 months ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
MP
2007
95views more  MP 2007»
13 years 9 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
ECRTS
1998
IEEE
14 years 2 months ago
Using exact feasibility tests for allocating real-time tasks in multiprocessor systems
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
Sergio Saez, Joan Vila i Carbó, Alfons Cres...
IPL
2006
141views more  IPL 2006»
13 years 10 months ago
Perfectly Reliable Message Transmission
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
Arvind Narayanan, K. Srinathan, C. Pandu Rangan