Sciweavers

3405 search results - page 545 / 681
» Factoring Groups Efficiently
Sort
View
SODA
2003
ACM
102views Algorithms» more  SODA 2003»
15 years 7 months ago
Online paging with arbitrary associativity
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
Enoch Peserico
PDPTA
2000
15 years 7 months ago
On the application of accelerating simulation methods in network analysis
When evaluating quantitative aspects of communication networks using simulation, one of the main difficulties to face is the often considerable computing power required. In some s...
José Incera, Gerardo Rubino, Nicolás...
WCE
2007
15 years 7 months ago
High-Performance Multigrid Solvers in Reconfigurable Hardware
—Partial Differential Equations (PDEs) play an essential role in modeling real world problems. The broad field of modeling such systems has drawn the researchers’ attention for...
Safaa J. Kasbah, Issam W. Damaj
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
165views Optimization» more  GECCO 2008»
15 years 7 months ago
Dual-population genetic algorithm for nonstationary optimization
In order to solve nonstationary optimization problems efficiently, evolutionary algorithms need sufficient diversity to adapt to environmental changes. The dual-population genetic...
Taejin Park, Ri Choe, Kwang Ryel Ryu