Sciweavers

Share
ISLPED
1998
ACM
94views Hardware» more  ISLPED 1998»
9 years 5 months ago
Theoretical bounds for switching activity analysis in finite-state machines
- The objective of this paper is to provide lower and upper bounds for the switching activity on the state lines in Finite State Machines (FSMs). Using a Markov chain model for the...
Diana Marculescu, Radu Marculescu, Massoud Pedram
DATE
1998
IEEE
93views Hardware» more  DATE 1998»
9 years 5 months ago
Exact and Approximate Estimation for Maximum Instantaneous Current of CMOS Circuits
We present an integer-linear-programming-based approach for estimating the maximum instantaneous current through the power supply lines for CMOS circuits. It produces the exact so...
Yi-Min Jiang, Kwang-Ting Cheng
IPPS
1999
IEEE
9 years 5 months ago
A Parallel Algorithm for Bound-Smoothing
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...
Kumar Rajan, Narsingh Deo
ASPDAC
1999
ACM
100views Hardware» more  ASPDAC 1999»
9 years 5 months ago
A Method for Evaluating Upper Bound of Simultaneous Switching Gates Using Circuit Partition
: This paper presents a method for evaluating an upper bound of simultaneous switching gates in combinational circuits. In this method, the original circuit is partitioned into sub...
Kai Zhang, Tsuyoshi Shinogi, Haruhiko Takase, Teru...
COLT
2000
Springer
9 years 5 months ago
Bias-Variance Error Bounds for Temporal Difference Updates
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...
Michael J. Kearns, Satinder P. Singh
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
9 years 5 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
COLT
2001
Springer
9 years 5 months ago
Intrinsic Complexity of Learning Geometrical Concepts from Positive Data
Intrinsic complexity is used to measure the complexity of learning areas limited by broken-straight lines (called open semi-hulls) and intersections of such areas. Any strategy le...
Sanjay Jain, Efim B. Kinber
CSL
2009
Springer
9 years 6 months ago
Upper Bounds on Stream I/O Using Semantic Interpretations
This paper extends for the first time semantic interpretation tools to infinite data in order to ensure Input/Output upper bounds on first order Haskell like programs on streams...
Marco Gaboardi, Romain Péchoux
SPAA
2010
ACM
9 years 6 months ago
Basic network creation games
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
Noga Alon, Erik D. Demaine, MohammadTaghi Hajiagha...
ERSHOV
2003
Springer
9 years 6 months ago
Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
Henrik Björklund, Sven Sandberg, Sergei G. Vo...
books