427 search results - page 37 / 86 » A Graph Based Synthesis Algorithm for Solving CSPs |
SEFM
2008
IEEE
14 years 3 months ago
2008
IEEE
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 ...
DAC
2001
ACM
14 years 10 months ago
2001
ACM
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
TCAD
2008
13 years 8 months ago
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
ASIAMS
2007
IEEE
14 years 3 months ago
2007
IEEE
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...