Sciweavers

461 search results - page 54 / 93
» An Algorithm for Bi-Decomposition of Logic Functions
Sort
View
82
Voted
IJCAI
2001
14 years 11 months ago
Symbolic Dynamic Programming for First-Order MDPs
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 ...
Craig Boutilier, Raymond Reiter, Bob Price
DAC
2006
ACM
15 years 10 months ago
SAT sweeping with local observability don't-cares
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...
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto...
AHS
2006
IEEE
119views Hardware» more  AHS 2006»
15 years 3 months ago
Particle Swarm Optimization with Discrete Recombination: An Online Optimizer for Evolvable Hardware
Self-reconfigurable adaptive systems have the possibility of adapting their own hardware configuration. This feature provides enhanced performance and flexibility, reflected i...
Jorge Peña, Andres Upegui, Eduardo Sanchez
PODS
2010
ACM
205views Database» more  PODS 2010»
15 years 2 months ago
Positive higher-order queries
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
Michael Benedikt, Gabriele Puppis, Huy Vu
110
Voted
FLOPS
2010
Springer
15 years 4 months ago
Code Generation via Higher-Order Rewrite Systems
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
Florian Haftmann, Tobias Nipkow