4112 search results - page 353 / 823 » Efficient Algorithms for the Spoonerism Problem |
206
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
172
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
In this paper the blind image deconvolution (BID) problem is solved using the Bayesian framework. In order to find the parameters of the proposed Bayesian model we present a new g...
185
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For ...
180
click to vote
IPPS
2006
IEEE
16 years 28 days ago
2006
IEEE
DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...
163
click to vote
ISCAS
2005
IEEE
16 years 14 days ago
2005
IEEE
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...