Sciweavers

959 search results - page 148 / 192
» Fundamental Concepts in Programming Languages
Sort
View
ALP
1992
Springer
14 years 18 days ago
Definitional Trees
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
Sergio Antoy
IFIP
1992
Springer
14 years 17 days ago
Intelligent Access to Data and Knowledge Bases via User's Topics of Interest
Retrieving relevant information in Data and Knowledge Bases containing a large number of di erent types of information is a non trivial problem. That is the reason why, in areas l...
Sylvie Cazalens, Robert Demolombe
ESOP
2000
Springer
14 years 3 days ago
Polyvariant Flow Analysis with Constrained Types
Abstract. The basic idea behind improving the quality of a monovariant control flow analysis such as 0CFA is the concept of polyvariant analyses such as Agesen's Cartesian Pro...
Scott F. Smith, Tiejun Wang
ICALP
2011
Springer
12 years 12 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
TON
2012
11 years 11 months ago
Independent Directed Acyclic Graphs for Resilient Multipath Routing
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
Sangman Cho, Theodore Elhourani, Srinivasan Ramasu...