3914 search results - page 483 / 783 » Automating SLA modeling |
189
click to vote
ICLP
2001
Springer
15 years 11 months ago
2001
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing solutions to goals. Quite a few interesting applications of tabling...
166
click to vote
LICS
2000
IEEE
15 years 11 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
186
click to vote
TIME
2000
IEEE
15 years 11 months ago
2000
IEEE
In spatiotemporal applications, meaningful changes vary according to object type, level of detail, and nature of application. In this paper, we introduce a dynamic classification ...
166
click to vote
ECAI
2000
Springer
15 years 11 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
170
click to vote
TPHOL
1999
IEEE
15 years 11 months ago
1999
IEEE
The standard versions of HOL only support disjoint sums over finite families of types. This paper introduces disjoint sums over type classes containing possibly a countably infinit...