Sciweavers

1027 search results - page 48 / 206
» Comparing Search Algorithms for the Temperature Inversion Pr...
Sort
View
TJS
2008
95views more  TJS 2008»
13 years 7 months ago
Combating I-O bottleneck using prefetching: model, algorithms, and ramifications
Multiple memory models have been proposed to capture the effects of memory hierarchy culminating in the I-O model of Aggarwal and Vitter [?]. More than a decade of architectural a...
Akshat Verma, Sandeep Sen
SAC
2004
ACM
14 years 1 months ago
Solving the error correcting code problem with parallel hybrid heuristics
Some telecommunication systems can not afford the cost of repeating a corrupted message. Instead, the message should be somewhat “corrected” by the receiver. In these cases a...
Enrique Alba, J. Francisco Chicano
CEC
2007
IEEE
14 years 2 months ago
Implicit alternative splicing for genetic algorithms
— In this paper we present a new nature-inspired variation operator for binary encodings in genetic algorithms (GAs). Our method, called implicit alternative splicing (iAS), is r...
Philipp Rohlfshagen, John A. Bullinaria
HIPC
2004
Springer
14 years 1 months ago
Lock-Free Parallel Algorithms: An Experimental Study
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...
Guojing Cong, David A. Bader
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
14 years 15 days ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom