Sciweavers

3865 search results - page 596 / 773
» Active memory operations
Sort
View
DAMON
2009
Springer
15 years 7 months ago
k-ary search on modern processors
This paper presents novel tree-based search algorithms that exploit the SIMD instructions found in virtually all modern processors. The algorithms are a natural extension of binar...
Benjamin Schlegel, Rainer Gemulla, Wolfgang Lehner
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
15 years 7 months ago
A parallel evolutionary algorithm for unconstrained binary quadratic problems
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
István Borgulya
GECCO
2008
Springer
144views Optimization» more  GECCO 2008»
15 years 7 months ago
Multi-resistant radar jamming using genetic algorithms
The next generation of advanced self-protection jammers is expected to deliver effective and energy efficient jamming against modern air tracking radars. However, optimizing such ...
Hans Jonas Fossum Moen, Stein Kristoffersen
ESA
2010
Springer
162views Algorithms» more  ESA 2010»
15 years 6 months ago
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods
We report on the solution of a real-time scheduling problem that arises in the design of software-based operation control of aircraft. A set of tasks has to be distributed on a min...
Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S....
AAECC
2007
Springer
111views Algorithms» more  AAECC 2007»
15 years 6 months ago
When cache blocking of sparse matrix vector multiply works and why
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
Rajesh Nishtala, Richard W. Vuduc, James Demmel, K...