4118 search results - page 341 / 824 » Efficient Algorithms for Airline Problem |
144
Voted
ESA
2008
Springer
15 years 6 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
173
click to vote
CORR
2010
Springer
15 years 5 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...
134
click to vote
ICIP
2003
IEEE
16 years 6 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...
149
click to vote
DCC
2004
IEEE
16 years 4 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 ...
137
click to vote
IPPS
2006
IEEE
15 years 11 months 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...