Sciweavers

3208 search results - page 324 / 642
» A Lower Bound for Primality
Sort
View
ICCAD
1997
IEEE
106views Hardware» more  ICCAD 1997»
15 years 11 months ago
Accurate power estimation for large sequential circuits
A power estimation approach is presented in which blocks of consecutive vectors are selected at random from a user-supplied realistic input vector set and the circuit is simulated...
Joseph N. Kozhaya, Farid N. Najm
VLSID
1994
IEEE
124views VLSI» more  VLSID 1994»
15 years 11 months ago
ILP-Based Scheduling with Time and Resource Constraints in High Level Synthesis
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
Samit Chaudhuri, Robert A. Walker
COLT
1994
Springer
15 years 11 months ago
Efficient Reinforcement Learning
Realistic domains for learning possess regularities that make it possible to generalize experience across related states. This paper explores an environment-modeling framework tha...
Claude-Nicolas Fiechter
ICCI
1993
15 years 10 months ago
Interval-Set Algebra for Qualitative Knowledge Representation
The notion of interval sets is introduced as a new kind of sets, represented by a pair of sets, namely, the lower and upper bounds. The interval-set algebra may be regarded as a c...
Y. Y. Yao
STOC
1994
ACM
123views Algorithms» more  STOC 1994»
15 years 10 months ago
Natural proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...
Alexander A. Razborov, Steven Rudich