Sciweavers

555 search results - page 75 / 111
» Improved results for a memory allocation problem
Sort
View
MICAI
2004
Springer
15 years 3 months ago
Faster Proximity Searching in Metric Data
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
Edgar Chávez, Karina Figueroa
LCPC
2000
Springer
15 years 1 months ago
Recursion Unrolling for Divide and Conquer Programs
This paper presents recursion unrolling, a technique for improving the performance of recursive computations. Conceptually, recursion unrolling inlines recursive calls to reduce c...
Radu Rugina, Martin C. Rinard
ASPLOS
2009
ACM
15 years 10 months ago
Phantom-BTB: a virtualized branch target buffer design
Modern processors use branch target buffers (BTBs) to predict the target address of branches such that they can fetch ahead in the instruction stream increasing concurrency and pe...
Ioana Burcea, Andreas Moshovos
ECAI
1998
Springer
15 years 2 months ago
Optimal Scheduling of Dynamic Progressive Processing
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
Abdel-Illah Mouaddib, Shlomo Zilberstein
VLSID
2003
IEEE
104views VLSI» more  VLSID 2003»
15 years 10 months ago
Analyzing Soft Errors in Leakage Optimized SRAM Design
Reducing leakage power and improving the reliability of data stored in the memory cells are both becoming challenging as technology scales down. While the smaller threshold voltag...
Vijay Degalahal, Narayanan Vijaykrishnan, Mary Jan...