3206 search results - page 431 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
120
click to vote
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
126
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
130
click to vote
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...
129
click to vote
ICC
2008
IEEE
15 years 8 months ago
2008
IEEE
—MIMO links can significantly improve network throughput by supporting multiple concurrent data streams between a pair of nodes and suppressing wireless interference. In this pa...
132
click to vote
CVPR
2004
IEEE
16 years 4 months ago
2004
IEEE
Our paper has two main contributions. Firstly, it presents a model for image sequences motivated by an image encoding perspective. It models accreted regions, where objects appear...