963 search results - page 51 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper we propose a parallel hybrid genetic method for solving Quadratic 3-dimensional Assignment Problem (Q3AP). This problem is proved to be computationally NP-hard. The ...
122
click to vote
GECCO
2011
Springer
14 years 3 months ago
2011
Springer
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...
TCS
2008
14 years 11 months ago
2008
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
102
click to vote
MVA
1996
15 years 1 months ago
1996
This paper presents an original algorithm for the computation of optical ow called Orthogonal Dynamic Programming (ODP) as well as several enhancements to it. The principle is to ...
CVPR
2010
IEEE
15 years 1 months ago
2010
IEEE
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...