Sciweavers

879 search results - page 115 / 176
» Optimizing for Reduced Code Space using Genetic Algorithms
Sort
View
VLDB
2004
ACM
163views Database» more  VLDB 2004»
15 years 10 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
AI
2011
Springer
14 years 11 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
155
Voted
TSP
2008
147views more  TSP 2008»
15 years 4 months ago
Low-Complexity MIMO Multiuser Receiver: A Joint Antenna Detection Scheme for Time-Varying Channels
Abstract--This paper deals with the uplink of a wireless multiple-input multiple-output (MIMO) communication system based on multicarrier (MC) code division multiple access (CDMA)....
Charlotte Dumard, Thomas Zemen
CC
2001
Springer
15 years 8 months ago
Goal-Directed Value Profiling
Compilers can exploit knowledge that a variable has a fixed known value at a program point for optimizations such as code specialization and constant folding. Recent work has shown...
Scott A. Watterson, Saumya K. Debray
PLDI
2000
ACM
15 years 8 months ago
Off-line variable substitution for scaling points-to analysis
Most compiler optimizations and software productivity tools rely on information about the effects of pointer dereferences in a program. The purpose of points-to analysis is to com...
Atanas Rountev, Satish Chandra