317 search results - page 32 / 64 » Factoring logic functions using graph partitioning |
82
Voted
IJCAI
2001
14 years 11 months ago
2001
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
DAC
2006
ACM
15 years 10 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
LOPSTR
2004
Springer
15 years 3 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
72
Voted
ICMLA
2008
14 years 11 months ago
2008
Accurate prediction of survival rates of cancer patients is often key to stratify patients for prognosis and treatment. Survival prediction is often accomplished by the TNM system...
73
Voted
FOCS
1993
IEEE
15 years 1 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...