Sciweavers

413 search results - page 13 / 83
» Algorithms for the automatic extension of an instruction-set
Sort
View
ASIAN
2006
Springer
118views Algorithms» more  ASIAN 2006»
15 years 3 months ago
An Approach to Formal Verification of Arithmetic Functions in Assembly
Abstract. It is customary to write performance-critical parts of arithmetic functions in assembly: this enables finely-tuned algorithms that use specialized processor instructions....
Reynald Affeldt, Nicolas Marti
ACG
2009
Springer
15 years 6 months ago
Automated Discovery of Search-Extension Features
One of the main challenges with selective search extensions is designing effective move categories (features). This is a manual trial and error task, which requires both intuition...
Pálmi Skowronski, Yngvi Björnsson, Mar...
HICSS
2007
IEEE
135views Biometrics» more  HICSS 2007»
15 years 6 months ago
Composable Language Extensions for Computational Geometry: A Case Study
— This paper demonstrates how two different sets of powerful domain specific language features can be specified and deployed as composable language extensions. These extensions...
Eric Van Wyk, Eric Johnson
IDEAS
2007
IEEE
144views Database» more  IDEAS 2007»
15 years 6 months ago
An Extensible and Personalized Approach to QoS-enabled Service Discovery
We present an extensible and customizable framework for the autonomous discovery of Semantic Web services based on their QoS properties. Using semantic technologies, users can spe...
Le-Hung Vu, Fabio Porto, Karl Aberer, Manfred Haus...
ESTIMEDIA
2006
Springer
15 years 3 months ago
Use of a Bit-true Data Flow Analysis for Processor-Specific Source Code Optimization
Nowadays, key characteristics of a processor's instruction set are only exploited in high-level languages by using inline assembly or compiler intrinsics. Inserting intrinsic...
Heiko Falk, Jens Wagner, André Schaefer