Sciweavers

2703 search results - page 237 / 541
» Optimizing memory transactions
Sort
View
WEA
2010
Springer
300views Algorithms» more  WEA 2010»
15 years 11 months ago
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
Charles Delort, Olivier Spanjaard
AINA
2008
IEEE
15 years 11 months ago
Performance Optimization of Temporal Reasoning for Grid Workflows Using Relaxed Region Analysis
With quick evolution of grid technologies and increasing complexity of e-Science applications, reasoning temporal properties of grid workflows to ensure reliability and trustworth...
Ke Xu, Junwei Cao, Lianchen Liu, Cheng Wu
SIPS
2007
IEEE
15 years 10 months ago
Optimal Data Mapping for Motion Compensation in H.264 Video Decoding
— Long initial access cycles of SDRAM are the major performance burden of motion compensation in a video decoder. To minimize its effect while improve overall available memory ba...
Guo-Shiuan Yu, Tian-Sheuan Chang
SAS
2007
Springer
111views Formal Methods» more  SAS 2007»
15 years 10 months ago
Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis
Abstract. Pointer information is a prerequisite for most program analyses, and inclusion-based, i.e. Andersen-style, pointer analysis is widely used to compute such information. Ho...
Ben Hardekopf, Calvin Lin
PATMOS
2004
Springer
15 years 9 months ago
Optimal Logarithmic Representation in Terms of SNR Behavior
This paper investigates the Signal-to-Noise Ratio (SNR) performance of the Logarithmic Number System (LNS) representation against the SNR performance of the fixed-point representa...
Panagiotis D. Vouzis, Vassilis Paliouras