2703 search results - page 272 / 541 » Optimizing memory transactions |
155
click to vote
GPEM
2002
15 years 4 months ago
2002
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
135
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
We propose a global optimization framework for 3D shape reconstruction from sparse noisy 3D measurements frequently encountered in range scanning, sparse featurebased stereo, and ...
107
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
138
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
With the increasing gap between processor speed and memory latency, the performance of data-dominated programs are becoming more reliant on fast data access, which can be improved...
132
click to vote
SCCC
1997
IEEE
15 years 8 months ago
1997
IEEE
In a database system, read operations are much more common than write operations, and consequently, database systems have been read optimized. As the size of main memory increases...