Sciweavers

2313 search results - page 136 / 463
» On Heuristic Time Hierarchies
Sort
View
IPPS
2008
IEEE
16 years 26 days ago
SWAMP: Smith-Waterman using associative massive parallelism
One of the most commonly used tools by computational biologists is some form of sequence alignment. Heuristic alignment algorithms developed for speed and their multiple results s...
Shannon Steinfadt, Johnnie W. Baker
CEC
2007
IEEE
16 years 24 days ago
SAT-decoding in evolutionary algorithms for discrete constrained optimization problems
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
Martin Lukasiewycz, Michael Glaß, Christian ...
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
15 years 11 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
ICDCS
2000
IEEE
15 years 11 months ago
Static and Adaptive Data Replication Algorithms for Fast Information Access in Large Distributed Systems
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
Thanasis Loukopoulos, Ishfaq Ahmad
ISCC
2000
IEEE
104views Communications» more  ISCC 2000»
15 years 11 months ago
Dynamic Routing and Wavelength Assignment Using First Policy Iteration
With standard assumptions the routing and wavelength assignment problem (RWA) can be viewed as a Markov Decision Process (MDP). The problem, however, defies an exact solution bec...
Esa Hyytiä, Jorma T. Virtamo