6976 search results - page 141 / 1396 » The Oil Searching Problem |
205
click to vote
TIP
2002
15 years 6 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
161
click to vote
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we study a complex real world workforce scheduling problem. We apply constructive search and variable neighbourhood search (VNS) metaheuristics and enhance these meth...
203
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
155
click to vote
PVLDB
2008
15 years 5 months ago
2008
We study the problem of efficiently evaluating similarity queries on histories, where a history is a d-dimensional time
160
click to vote
ACG
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Kakuro consists in filling a grid with integers that sum up to predefined values. Sums are predefined for each row and column and all integers have to be different in ...