Sciweavers

10899 search results - page 1825 / 2180
» The GP Programming System
Sort
View
AMAST
2008
Springer
15 years 8 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
ASAP
2008
IEEE
199views Hardware» more  ASAP 2008»
15 years 8 months ago
An efficient method for evaluating polynomial and rational function approximations
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
Nicolas Brisebarre, Sylvain Chevillard, Milos D. E...
ATAL
2008
Springer
15 years 8 months ago
Belief operations for motivated BDI agents
The beliefs of an agent reflecting her subjective view of the world constitute one of the main components of a BDI agent. In order to incorporate new information coming from other...
Patrick Krümpelmann, Matthias Thimm, Manuela ...
CC
2008
Springer
123views System Software» more  CC 2008»
15 years 8 months ago
Automatic Transformation of Bit-Level C Code to Support Multiple Equivalent Data Layouts
Portable low-level C programs must often support multiple equivalent in-memory layouts of data, due to the byte or bit order of the compiler, architecture, or external data formats...
Marius Nita, Dan Grossman
248
Voted
CC
2008
Springer
172views System Software» more  CC 2008»
15 years 8 months ago
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
The performance of heap analysis techniques has a significant impact on their utility in an optimizing compiler. Most shape analysis techniques perform interprocedural dataflow ana...
Mark Marron, Manuel V. Hermenegildo, Deepak Kapur,...
« Prev « First page 1825 / 2180 Last » Next »