2703 search results - page 406 / 541 » Optimizing memory transactions |
168
Voted
TIP
2002
15 years 3 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...
214
Voted
EVOW
2009
Springer
15 years 1 months ago
2009
Springer
In recent years, optimization in dynamic environments has attracted a growing interest from the genetic algorithm community due to the importance and practicability in real world a...
145
Voted
ICRA
2009
IEEE
15 years 1 months ago
2009
IEEE
Contextual reasoning through graphical models such as Markov Random Fields often show superior performance against local classifiers in many domains. Unfortunately, this performanc...
149
click to vote
CVPR
2011
IEEE
15 years 1 months ago
2011
IEEE
In this paper we propose a distributed message-passing algorithm for inference in large scale graphical models. Our method can handle large problems efficiently by distributing a...
159
click to vote
COR
2011
2011
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
14 years 10 months ago
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...