Sciweavers

134 search results - page 20 / 27
» Speeding Up Dynamic Shortest-Path Algorithms
Sort
View
TASE
2008
IEEE
13 years 7 months ago
An Optimization-Based Approach for Design Project Scheduling
Concurrent engineering has been widely used in managing design projects to speed up the design process by concurrently performing multiple tasks. Since the progress of a design tas...
Ming Ni, Peter B. Luh, Bryan Moser
ICDE
2011
IEEE
235views Database» more  ICDE 2011»
12 years 11 months ago
Fast data analytics with FPGAs
—The rapidly increasing amount of data available for real-time analysis (i.e., so-called operational business intelligence) is creating an interesting opportunity for creative ap...
Louis Woods, Gustavo Alonso
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 2 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
ICPADS
2006
IEEE
14 years 1 months ago
On-line Evolutionary Resource Matching for Job Scheduling in Heterogeneous Grid Environments
In this paper, we describe a resource matcher (RM) developed for the on-line resource matching in heterogeneous grid environments. RM is based on the principles of Evolutionary Al...
Vijay K. Naik, Pawel Garbacki, Krishna Kummamuru, ...
IJCNN
2007
IEEE
14 years 1 months ago
Parallel Learning of Large Fuzzy Cognitive Maps
— Fuzzy Cognitive Maps (FCMs) are a class of discrete-time Artificial Neural Networks that are used to model dynamic systems. A recently introduced supervised learning method, wh...
Wojciech Stach, Lukasz A. Kurgan, Witold Pedrycz