Sciweavers

4714 search results - page 102 / 943
» The Complexity of Iterated Multiplication
Sort
View
113
Voted
ASPDAC
2006
ACM
130views Hardware» more  ASPDAC 2006»
15 years 9 months ago
Convergence-provable statistical timing analysis with level-sensitive latches and feedback loops
Statistical timing analysis has been widely applied to predict the timing yield of VLSI circuits when process variations become significant. Existing statistical latch timing met...
Lizheng Zhang, Jeng-Liang Tsai, Weijen Chen, Yuhen...
128
Voted
UAI
2008
15 years 5 months ago
Sparse Stochastic Finite-State Controllers for POMDPs
Bounded policy iteration is an approach to solving infinitehorizon POMDPs that represents policies as stochastic finitestate controllers and iteratively improves a controller by a...
Eric A. Hansen
120
Voted
IJCAI
1989
15 years 4 months ago
Solving Time-Dependent Planning Problems
A planning problem is time-dependent, if the time spent planning affects the utility of the system's performance. In [Dean and Boddy, 1988], we define a framework for constru...
Mark S. Boddy, Thomas Dean
163
Voted
ISAAC
2010
Springer
243views Algorithms» more  ISAAC 2010»
15 years 1 months ago
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
Thomas Dueholm Hansen, Uri Zwick
131
Voted
CHES
2005
Springer
83views Cryptology» more  CHES 2005»
15 years 9 months ago
Fast Truncated Multiplication for Cryptographic Applications
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
Laszlo Hars