Sciweavers

1712 search results - page 42 / 343
» A Computational Approach to Binding Theory
Sort
View
JFP
2008
72views more  JFP 2008»
14 years 11 months ago
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Peter Sewell, Gareth Stoyle, Michael Hicks, Gavin ...
CGF
2008
75views more  CGF 2008»
14 years 12 months ago
Extraction Of Feature Lines On Surface Meshes Based On Discrete Morse Theory
We present an approach for extracting extremal feature lines of scalar indicators on surface meshes, based on discrete Morse Theory. By computing initial Morse-Smale complexes of ...
Jan Sahner, Britta Weber, Steffen Prohaska, Hans L...
BIRTHDAY
2000
Springer
15 years 4 months ago
Prioritizing Default Logic
A number of prioritized variants of Reiter’s default logic have been described in the literature. In this paper, we introduce two natural principles for preference handling and s...
Gerhard Brewka, Thomas Eiter
TSD
2007
Springer
15 years 6 months ago
Logic-Based Rhetorical Structuring for Natural Language Generation in Human-Computer Dialogue
Abstract. Rhetorical structuring is field approached mostly by research in natural language (pragmatic) interpretation. However, in natural language generation (NLG) the rhetorica...
Vladimir Popescu, Jean Caelen, Corneliu Burileanu
DSN
2007
IEEE
15 years 3 months ago
Foundations of Measurement Theory Applied to the Evaluation of Dependability Attributes
Increasing interest is being paid to quantitative evaluation based on measurements of dependability attributes and metrics of computer systems and infrastructures. Despite measura...
Andrea Bondavalli, Andrea Ceccarelli, Lorenzo Fala...