Sciweavers

129 search results - page 12 / 26
» Compiling Possibilistic Knowledge Bases
Sort
View
SASP
2009
IEEE
291views Hardware» more  SASP 2009»
14 years 2 months ago
FCUDA: Enabling efficient compilation of CUDA kernels onto FPGAs
— As growing power dissipation and thermal effects disrupted the rising clock frequency trend and threatened to annul Moore’s law, the computing industry has switched its route...
Alexandros Papakonstantinou, Karthik Gururaj, John...
LPNMR
2001
Springer
13 years 12 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits
ASPLOS
1994
ACM
13 years 11 months ago
Compiler Optimizations for Improving Data Locality
In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effe...
Steve Carr, Kathryn S. McKinley, Chau-Wen Tseng
DKE
2007
131views more  DKE 2007»
13 years 7 months ago
Reasoning and change management in modular ontologies
ct 9 The benefits of modular representations are well known from many areas of computer science. While in software engi10 neering modularization is mainly a vehicle for supporting...
Heiner Stuckenschmidt, Michel C. A. Klein
LREC
2008
85views Education» more  LREC 2008»
13 years 9 months ago
A Method for Automatically Constructing Case Frames for English
Case frames are an important knowledge base for a variety of natural language processing (NLP) systems. For the practical use of these systems in the real world, wide-coverage cas...
Daisuke Kawahara, Kiyotaka Uchimoto