3914 search results - page 158 / 783 » Automating SLA modeling |
114
Voted
PLILP
1993
Springer
15 years 6 months ago
1993
Springer
This paper shows a multisequential model to exploit OR parallelism on distributed memory systems. It presents an implementation of the incremental copy mechanism oriented to distr...
126
click to vote
LICS
1989
IEEE
15 years 6 months ago
1989
IEEE
We explore ideal models for a programming language with recursive polymorphic types, variants of the model studied by MacQueen, Plotkin, and Sethi. The use of suitable ideals yiel...
113
Voted
DLOG
2008
15 years 4 months ago
2008
We show that reasoning in the temporal conceptual model ERV T , a fragment of ERV T that only allows timestamping is complete for 2-ExpTime. The membership result is based on an em...
153
Voted
EWCBR
2008
Springer
15 years 4 months ago
2008
Springer
In this paper, we introduce a new instance-based approach to the label ranking problem. This approach is based on a probability model on rankings which is known as the Mallows mode...
111
click to vote
ICLP
1990
Springer
15 years 6 months ago
1990
Springer
The logic programming language framework Kernel Andorra Prolog is de ned by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive langu...