Sciweavers

879 search results - page 87 / 176
» Optimizing for Reduced Code Space using Genetic Algorithms
Sort
View
150
Voted
CASES
2005
ACM
15 years 4 months ago
A post-compilation register reassignment technique for improving hamming distance code compression
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
Montserrat Ros, Peter Sutton
TREC
2003
15 years 3 months ago
Ranking Function Discovery by Genetic Programming for Robust Retrieval
Ranking functions are instrumental for the success of an information retrieval (search engine) system. However nearly all existing ranking functions are manually designed based on...
Li Wang, Weiguo Fan, Rui Yang, Wensi Xi, Ming Luo,...
JCM
2006
118views more  JCM 2006»
15 years 2 months ago
Joint Optimization of Local and Fusion Rules in a Decentralized Sensor Network
Decentralized sensor networks are collections of individual local sensors that observe a common phenomenon, quantize their observations, and send this quantized information to a ce...
Nithya Gnanapandithan, Balasubramaniam Natarajan
ISCAS
2006
IEEE
112views Hardware» more  ISCAS 2006»
15 years 8 months ago
Towards an optimised VLSI design algorithm for the constant matrix multiplication problem
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor
PLDI
1995
ACM
15 years 6 months ago
Selective Specialization for Object-Oriented Languages
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...
Jeffrey Dean, Craig Chambers, David Grove