Sciweavers

1017 search results - page 41 / 204
» Register computations on ordinals
Sort
View

Presentation
439views
12 years 1 months ago
Efficient Evaluation Methods of Elementary Functions Suitable for SIMD Computation
Data-parallel architectures like SIMD (Single Instruction Multiple Data) or SIMT (Single Instruction Multiple Thread) have been adopted in many recent CPU and GPU architectures. Al...
VLSID
2005
IEEE
102views VLSI» more  VLSID 2005»
14 years 8 months ago
Integrated On-Chip Storage Evaluation in ASIP Synthesis
An Application Specific Instruction Set Processor (ASIP) exploits special characteristics of the given application(s) to meet the desired performance, cost and power requirements....
Manoj Kumar Jain, M. Balakrishnan, Anshul Kumar
CIE
2007
Springer
14 years 1 months ago
Binary Trees and (Maximal) Order Types
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
Gyesik Lee
AGI
2011
12 years 11 months ago
Measuring Agent Intelligence via Hierarchies of Environments
Under Legg’s and Hutter’s formal measure [1], performance in easy environments counts more toward an agent’s intelligence than does performance in difficult environments. An ...
Bill Hibbard
ICSE
1993
IEEE-ACM
13 years 11 months ago
Rule-Based Approach to Computing Module Cohesion
Stevens, Myers, and Constantine introduced the notion of cohesion, an ordinal scale of seven levels that describes the degree to which the actions performed by a module contribute...
Arun Lakhotia