Sciweavers

1205 search results - page 83 / 241
» Program Extraction from Large Proof Developments
Sort
View
ICPP
1996
IEEE
15 years 8 months ago
Restructuring Programs for High-Speed Computers with Polaris
The ability to automatically parallelize standard programming languages results in program portability across a wide range of machine architectures. It is the goal of the Polaris ...
William Blume, Rudolf Eigenmann, Keith Faigin, Joh...
PPOPP
2012
ACM
14 years 7 days ago
DOJ: dynamically parallelizing object-oriented programs
We present Dynamic Out-of-Order Java (DOJ), a dynamic parallelization approach. In DOJ, a developer annotates code blocks as tasks to decouple these blocks from the parent executi...
Yong Hun Eom, Stephen Yang, James Christopher Jeni...
CADE
2007
Springer
15 years 11 months ago
Semantic Selection of Premisses for Automated Theorem Proving
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
Petr Pudlak
PADL
2000
Springer
15 years 8 months ago
Calculating a New Data Mining Algorithm for Market Basket Analysis
The general goal of data mining is to extract interesting correlated information from large collection of data. A key computationally-intensive subproblem of data mining involves ...
Zhenjiang Hu, Wei-Ngan Chin, Masato Takeichi
IROS
2008
IEEE
230views Robotics» more  IROS 2008»
15 years 11 months ago
Visual recognition of grasps for human-to-robot mapping
— This paper presents a vision based method for grasp classification. It is developed as part of a Programming by Demonstration (PbD) system for which recognition of objects and...
Hedvig Kjellström, Javier Romero, Danica Krag...