7648 search results - page 867 / 1530 » A Data Locality Optimizing Algorithm |
181
click to vote
WEA
2004
Springer
16 years 18 days ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
234
click to vote
PODC
2000
ACM
15 years 11 months ago
2000
ACM
Distributed programs are hard to write. A distributed debugger equipped with the mechanism to re-execute the traced computation in a controlled fashion can greatly facilitate the ...
213
click to vote
CP
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
160
Voted
ICRA
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper introduces a novel heuristic nmdmap method for path planning, one that is inspired by the Vomnoi diagmm concept, but easiZy applicable to geneml configurntion spaces. T...
217
click to vote
ACCV
2009
Springer
15 years 11 months ago
2009
Springer
Recent local state-of-the-art stereo algorithms based on variable cost aggregation strategies allow for inferring disparity maps comparable to those yielded by algorithms based on ...