2477 search results - page 141 / 496 » Parallelizing Functional Programs by Generalization |
135
Voted
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
A number of software packages are available for the construction of comprehensive human genetic maps. In this paper we parallelize the widely used package Genehunter. We restrict ...
114
click to vote
EURODAC
1994
IEEE
1994
IEEE
OSCAR: optimum simultaneous scheduling, allocation and resource binding based on integer programming
15 years 6 months ago
: This paper presents an approach to high-level synthesis which is based upon a 0/1 integer programming model. In contrast to other approaches, this model allows solving all three ...
101
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
110
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...