Sciweavers

3914 search results - page 220 / 783
» Automating SLA modeling
Sort
View
LPAR
2001
Springer
14 years 18 days ago
Permutation Problems and Channelling Constraints
When writing a constraint program, we have to decide what to make the decision variable, and how to represent the constraints on these variables. In many cases, there is considerab...
Toby Walsh
CSL
1997
Springer
14 years 10 days ago
From Action Calculi to Linear Logic
Abstract. Milner introduced action calculi as a framework for investigating models of interactive behaviour. We present a type-theoretic account of action calculi using the proposi...
Andrew Barber, Philippa Gardner, Masahito Hasegawa...
EWCBR
1993
Springer
14 years 8 days ago
Knowledge Engineering Requirements in Derivational Analogy
A major advantage in using a case-based approach to developing knowledge-based systems is that it can be applied to problems where a strong domain theory may be difficult to determ...
Padraig Cunningham, Donal Finn, Seán Slatte...
LOPSTR
1994
Springer
14 years 7 days ago
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
Annalisa Bossi, Sandro Etalle
PRICAI
2000
Springer
13 years 11 months ago
Trading Off Granularity against Complexity
The automated prediction of a user's interests and requirements is an area of interest to the Artificial Intelligence community. However, current predictive statistical approa...
Ingrid Zukerman, David W. Albrecht, Ann E. Nichols...