674 search results - page 96 / 135 » The computational complexity of the parallel knock-out probl... |
138
click to vote
CCGRID
2009
IEEE
15 years 2 months ago
2009
IEEE
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
116
click to vote
CCGRID
2007
IEEE
15 years 7 months ago
2007
IEEE
The number of processors embedded on high performance computing platforms is continuously increasing to accommodate user desire to solve larger and more complex problems. However,...
ICDCS
2007
IEEE
15 years 7 months ago
2007
IEEE
An electronic cash system allows users to withdraw coins, represented as bit strings, from a bank or broker, and spend those coins anonymously at participating merchants, so that ...
130
click to vote
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
DNA sequence alignment is a very important problem in bioinformatics. The algorithm proposed by Smith-Waterman (SW) is an exact method that obtains optimal local alignments in qua...
114
click to vote
IPPS
2006
IEEE
15 years 7 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...