Sciweavers

4978 search results - page 90 / 996
» Logical models of argument
Sort
View
ICASSP
2010
IEEE
13 years 10 months ago
Optimize the obvious: Automatic call flow generation
In commercial spoken dialog systems, call flows are built by call flow designers implementing a predefined business logic. While it may appear obvious from this logic how the c...
David Suendermann, Jackson Liscombe, Roberto Piera...
EUC
2008
Springer
13 years 11 months ago
Performance Comparison of Techniques on Static Path Analysis of WCET
Static path analysis is a key process of Worst Case Execution Time (WCET) estimation, the objective of which is to find the execution path that has the largest execution time. Cur...
Mingsong Lv, Zonghua Gu, Nan Guan, Qingxu Deng, Ge...
CADE
2009
Springer
14 years 10 months ago
Termination Analysis by Dependency Pairs and Inductive Theorem Proving
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
Carsten Fuhs, Jürgen Giesl, Michael Parting, ...
PEPM
1993
ACM
14 years 2 months ago
The Correctness of an Optimized Code Generation
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictne...
Torben Poort Lange
DLT
2008
13 years 11 months ago
Fixed Point and Aperiodic Tilings
An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics rangin...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...