Sciweavers

4126 search results - page 259 / 826
» Set based logic programming
Sort
View
CL
2000
Springer
15 years 10 months ago
FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine
This paper reports on the design and implementation of FLORA -- a powerful DOOD system that incorporates the features of F-logic, HiLog, and Transaction Logic. FLORA is implemented...
Guizhen Yang, Michael Kifer
MICRO
1997
IEEE
141views Hardware» more  MICRO 1997»
15 years 10 months ago
Unroll-and-Jam Using Uniformly Generated Sets
Modern architectural trends in instruction-level parallelism (ILP) are to increase the computational power of microprocessors significantly. As a result, the demands on memory ha...
Steve Carr, Yiping Guan
CVIU
2008
109views more  CVIU 2008»
15 years 6 months ago
Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual st
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
ITNG
2010
IEEE
15 years 4 months ago
Record Setting Software Implementation of DES Using CUDA
—The increase in computational power of off-the-shelf hardware offers more and more advantageous tradeoffs among efficiency, cost and availability, thus enhancing the feasibil...
Giovanni Agosta, Alessandro Barenghi, Fabrizio De ...
ICFP
2005
ACM
16 years 6 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...