Sciweavers

1059 search results - page 149 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
DAC
2006
ACM
14 years 10 months ago
Statistical logic cell delay analysis using a current-based model
A statistical model for the purpose of logic cell timing analysis in the presence of process variations is presented. A new current-based cell delay model is utilized, which can a...
Hanif Fatemi, Shahin Nazarian, Massoud Pedram
HIPC
2009
Springer
13 years 6 months ago
Extracting the textual and temporal structure of supercomputing logs
Supercomputers are prone to frequent faults that adversely affect their performance, reliability and functionality. System logs collected on these systems are a valuable resource o...
Sourabh Jain, Inderpreet Singh, Abhishek Chandra, ...
SPAA
2004
ACM
14 years 2 months ago
Packet-mode policies for input-queued switches
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
Dan Guez, Alexander Kesselman, Adi Rosén
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 10 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
SIGMETRICS
2002
ACM
128views Hardware» more  SIGMETRICS 2002»
13 years 8 months ago
High-density model for server allocation and placement
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
Craig W. Cameron, Steven H. Low, David X. Wei