Sciweavers

402 search results - page 15 / 81
» Automatic Abstraction for Worst-Case Analysis of Discrete Sy...
Sort
View
LOPSTR
2004
Springer
14 years 26 days ago
Fully Automatic Binding-Time Analysis for Prolog
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
Stephen-John Craig, John P. Gallagher, Michael Leu...
ICLP
1997
Springer
13 years 11 months ago
Automatic Termination Analysis of Logic Programs
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
Naomi Lindenstrauss, Yehoshua Sagiv
DAGM
2005
Springer
14 years 1 months ago
Regularization on Discrete Spaces
Abstract. We consider the classification problem on a finite set of objects. Some of them are labeled, and the task is to predict the labels of the remaining unlabeled ones. Such...
Dengyong Zhou, Bernhard Schölkopf
AMAST
2008
Springer
13 years 9 months ago
System Demonstration of Spiral: Generator for High-Performance Linear Transform Libraries
We demonstrate Spiral, a domain-specific library generation system. Spiral generates high performance source code for linear transforms (such as the discrete Fourier transform and ...
Yevgen Voronenko, Franz Franchetti, Fréd&ea...
DEDS
2008
94views more  DEDS 2008»
13 years 7 months ago
Approximate Simulation Relations for Hybrid Systems
Abstract Approximate simulation relations have recently been introduced as a powerful tool for the approximation of discrete and continuous systems. In this paper, we his abstracti...
Antoine Girard, A. Agung Julius, George J. Pappas