5115 search results - page 265 / 1023 » On Randomized Lanczos Algorithms |
181
click to vote
ICTAI
2005
IEEE
16 years 23 days ago
2005
IEEE
One of the major drawbacks in block-based discrete cosine transform (BDCT) is the blocking artifacts at low bit rates. In this paper, an adaptive deblocking algorithm based on Mar...
206
click to vote
IFIP
2004
Springer
16 years 16 days ago
2004
Springer
Geometrical place can be sometimes difficult to find by applying mathematical methods. Evolutionary algorithms deal with a population of solutions. This population (initially ran...
147
click to vote
CP
2004
Springer
16 years 17 days ago
2004
Springer
The stretch constraint occurs in many rostering problems that arise in the industrial and public service sectors. In this paper we present an efficient algorithm for domain consist...
214
click to vote
PPSN
2004
Springer
16 years 16 days ago
2004
Springer
We consider the problem of finding small Golomb rulers, a hard combinatorial optimization task. This problem is here tackled by means of a hybrid evolutionary algorithm (EA). This...
206
click to vote
IRREGULAR
1995
Springer
15 years 10 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...