Sciweavers

47 search results - page 8 / 10
» Deterministic random walks on the integers
Sort
View
VLSID
2008
IEEE
153views VLSI» more  VLSID 2008»
14 years 8 months ago
Total Power Minimization in Glitch-Free CMOS Circuits Considering Process Variation
Compared to subthreshold leakage, dynamic power is normally much less sensitive to the process variation due to its approximately linear relation to the process parameters. Howeve...
Yuanlin Lu, Vishwani D. Agrawal
COCOON
2001
Springer
14 years 7 days ago
On-Line Variable Sized Covering
We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item ...
Leah Epstein
INFOCOM
2009
IEEE
14 years 2 months ago
Virtual Network Embedding with Coordinated Node and Link Mapping
—Recently network virtualization has been proposed as a promising way to overcome the current ossification of the Internet by allowing multiple heterogeneous virtual networks (V...
N. M. Mosharaf Kabir Chowdhury, Muntasir Raihan Ra...
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
13 years 7 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...
MP
1998
109views more  MP 1998»
13 years 7 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra