2845 search results - page 97 / 569 » Constraints over Ontologies |
208
click to vote
ITA
2007
15 years 6 months ago
2007
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
139
click to vote
CN
1999
15 years 6 months ago
1999
A Partial Order and partial reliable Connection (POC) is an end-to-end transport connection authorized to deliver objects in an order that can differ from the transmitted one. Such...
164
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
202
click to vote
TCOM
2010
15 years 1 months ago
2010
Abstract--This paper develops an amplify-and-forward relaying scheme for multiuser wireless cooperative networks under frequency-selective block-fading. Single-carrier frequency di...
164
click to vote
ICALP
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...