Sciweavers

110 search results - page 4 / 22
» Generating Specialized Rules and Programs for Demand-Driven ...
Sort
View
FLOPS
2010
Springer
14 years 19 days ago
Tag-Free Combinators for Binding-Time Polymorphic Program Generation
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
Peter Thiemann, Martin Sulzmann
WETICE
1997
IEEE
13 years 11 months ago
MultiDisciplinary Design for Uninhabited Air Vehicles
Contemporary product design and process development is based on an iterative specify-evaluate-revise approach which is often time intensive and therein non-responsive to customer ...
Max Blair, Steven R. LeClair, Jeffrey V. Zweber, A...
AI
2006
Springer
13 years 11 months ago
Classification Based on Logical Concept Analysis
This paper studies the problem of classification by using a concept lattice as a search space of classification rules. The left hand side of a classification rule is composed by a ...
Yan Zhao, Yiyu Yao
ISIPTA
1999
IEEE
13 years 11 months ago
Treatment Choice Under Ambiguity Induced by Inferential Problems
Inferential problems that arise in the empirical analysis oftreatmentresponseinduceambiguityabouttheidentity of optimal treatment rules. This paper describes a research program th...
Charles F. Manski
CADE
2009
Springer
14 years 8 months ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Stephan Falke, Deepak Kapur