Sciweavers

75 search results - page 1 / 15
» Computing Applicability Conditions for Plans with Loops
Sort
View
AIPS
2010
13 years 7 months ago
Computing Applicability Conditions for Plans with Loops
The utility of including loops in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of representat...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
WEBI
2010
Springer
13 years 2 months ago
Learning Task Specific Web Services Compositions with Loops and Conditional Branches from Example Executions
Majority of the existing approaches to service composition, including the widely popular planning based techniques, are not able to automatically compose practical workflows that ...
Harini Veeraraghavan, Roman Vaculín, Manuel...
ACSC
2004
IEEE
13 years 8 months ago
Automatic Derivation of Loop Termination Conditions to Support Verification
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...
Daniel Powell
EUC
2005
Springer
13 years 10 months ago
Loop Distribution and Fusion with Timing and Code Size Optimization for Embedded DSPs
Abstract. Loop distribution and loop fusion are two effective loop transformation techniques to optimize the execution of the programs in DSP applications. In this paper, we propo...
Meilin Liu, Qingfeng Zhuge, Zili Shao, Chun Xue, M...
ISCAPDCS
2003
13 years 6 months ago
Loop Transformation Techniques To Aid In Loop Unrolling and Multithreading
In modern computer systems loops present a great deal of opportunities for increasing Instruction Level and Thread Level Parallelism. Loop unrolling is a technique used to obtain ...
Litong Song, Yuhua Zhang, Krishna M. Kavi