Sciweavers

177 search results - page 23 / 36
» The garbage collection advantage: improving program locality
Sort
View
HPCA
2009
IEEE
14 years 9 months ago
Feedback mechanisms for improving probabilistic memory prefetching
This paper presents three techniques for improving the effectiveness of the recently proposed Adaptive Stream Detection (ASD) prefetching mechanism. The ASD prefetcher is a standa...
Ibrahim Hur, Calvin Lin
MFCS
2009
Springer
14 years 1 months ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
PROMISE
2010
13 years 3 months ago
Exploiting count spectra for Bayesian fault localization
Background: Automated diagnosis of software defects can drastically increase debugging efficiency, improving reliability and time-to-market. Current, low-cost, automatic fault dia...
Rui Abreu, Alberto González-Sanchez, Arjan ...
GECCO
2009
Springer
258views Optimization» more  GECCO 2009»
14 years 1 months ago
Evolutionary learning of local descriptor operators for object recognition
Nowadays, object recognition is widely studied under the paradigm of matching local features. This work describes a genetic programming methodology that synthesizes mathematical e...
Cynthia B. Pérez, Gustavo Olague
CP
2005
Springer
14 years 2 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen