Sciweavers

13 search results - page 3 / 3
» Cycle bases of graphs and sampled manifolds
Sort
View
SEFM
2008
IEEE
14 years 5 days ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...
ICCAD
2009
IEEE
117views Hardware» more  ICCAD 2009»
13 years 3 months ago
Binning optimization based on SSTA for transparently-latched circuits
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
Min Gong, Hai Zhou, Jun Tao, Xuan Zeng
AIPS
2007
13 years 8 months ago
Learning to Plan Using Harmonic Analysis of Diffusion Models
This paper summarizes research on a new emerging framework for learning to plan using the Markov decision process model (MDP). In this paradigm, two approaches to learning to plan...
Sridhar Mahadevan, Sarah Osentoski, Jeffrey Johns,...