180 search results - page 6 / 36 » Achieving Scalability in Parallel Tabled Logic Programs |
PPOPP
2011
ACM
12 years 10 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
ECAI
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
MICRO
2010
IEEE
13 years 5 months ago
2010
IEEE
While clusters of commodity servers and switches are the most popular form of large-scale parallel computers, many programs are not easily parallelized for execution upon them. In...
CAL
2007
13 years 7 months ago
2007
—The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. ...
ESWS
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. The current state of the art regarding scalable reasoning consists of programs that run on a single machine. When the amount of data is too large, or the logic is too com...