303 search results - page 25 / 61 » Unifying Theories of Confidentiality |
CC
2007
Springer
14 years 1 months ago
2007
Springer
Program refactoring, feature-based and aspect-oriented software synthesis, and model-driven development are disjoint research areas. However, they are all architectural metaprogram...
ICALP
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
CP
2008
Springer
13 years 11 months ago
2008
Springer
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. Thes...
AI
2002
Springer
13 years 9 months ago
2002
Springer
Abstract. The traditional unification is strict in the sense that it requires a perfect agreement between the terms being unified. In practice, data is seldom error-free and can co...
SOFSEM
2009
Springer
14 years 2 months ago
2009
Springer
In this text we will discuss different forms of randomness in Natural Sciences and present some recent results relating them. In finite processes, randomness differs in various ...