Sciweavers

136 search results - page 12 / 28
» A Provably Correct Compiler Generator
Sort
View
AIPS
1996
13 years 9 months ago
Deduction-Based Refinement Planning
Weintroduce a method of deduction-based refinement planning where prefabricated general solutions are adapted to special problems. Refmementproceeds by stepwise transforming nonco...
Werner Stephan, Susanne Biundo
EUROPAR
2004
Springer
14 years 1 months ago
More Legal Transformations for Locality
Abstract. Program transformations are one of the most valuable compiler techniques to improve data locality. However, restructuring compilers have a hard time coping with data depe...
Cédric Bastoul, Paul Feautrier
PLDI
2006
ACM
14 years 1 months ago
A global progressive register allocator
This paper describes a global progressive register allocator, a register allocator that uses an expressive model of the register allocation problem to quickly find a good allocat...
David Ryan Koes, Seth Copen Goldstein
IROS
2006
IEEE
113views Robotics» more  IROS 2006»
14 years 1 months ago
A Framework for Automatic Deployment of Robots in 2D and 3D Environments
Abstract— We present a computational framework for automatic deployment of robots in 2D and 3D rectangular environments with polytopal obstacles. The results are derived for poly...
Marius Kloetzer, Calin Belta
IJCAI
2001
13 years 9 months ago
SiN: Integrating Case-based Reasoning with Task Decomposition
This paper describes SiN, a novel case-based planning algorithm that combines conversational case retrieval with generative planning. SiN is provably correct, and can generate pla...
Héctor Muñoz-Avila, David W. Aha, Da...