1361 search results - page 117 / 273 » Spaces of practice |
124
click to vote
CONCUR
1991
Springer
15 years 7 months ago
1991
Springer
This paper deals with verification methods based on equivalence relations between labeled transition systems. More precisely, we are concerned by two practical needs: how to effi...
119
click to vote
NETWORKING
2007
15 years 5 months ago
2007
In this paper, we propose a practical and efficient technique, Forecaster, to estimate (1) the end-to-end available bandwidth, and (2) the speed of the most congested (tight) link ...
105
click to vote
IJCAI
1993
15 years 5 months ago
1993
The Dempster-Shafer theory gives a solid basis for reasoning applications characterized by uncertainty. A key feature of the theory is that propositions are represented as subsets...
151
click to vote
C3S2E
2010
ACM
15 years 4 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
191
click to vote
ISEMANTICS
2010
15 years 2 months ago
2010
The Web has evolved from a global information space of linked documents to a web of linked data. The Web of Data enables answering complex, structured queries that could not be an...