201 search results - page 14 / 41 » Predicting locality phases for dynamic memory optimization |
PLDI
2005
ACM
15 years 3 months ago
2005
ACM
Code placement techniques have traditionally improved instruction fetch bandwidth by increasing instruction locality and decreasing the number of taken branches. However, traditio...
112
click to vote
RAS
2006
14 years 9 months ago
2006
This paper considers trajectory planning problems for autonomous robots in information gathering tasks. The objective of the planning is to maximize the information gathered withi...
166
click to vote
LCPC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Data copy is an important compiler optimization which dynamically rearranges the layout of arrays by copying their elements into local buffers. Traditionally, array copy...
113
click to vote
CSL
2008
Springer
14 years 11 months ago
2008
Springer
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...
IROS
2006
IEEE
15 years 3 months ago
2006
IEEE
– Active SLAM poses the challenge for an autonomous robot to plan efficient paths simultaneous to the SLAM process. The uncertainties of the robot, map and sensor measurements, a...