937 search results - page 105 / 188 » On the Complexity of Partial Order Properties |
187
click to vote
ICIW
2008
IEEE
16 years 18 days ago
2008
IEEE
—With the increasing development of real applications using Semantic Web Technologies, it is necessary to provide scalable and efficient ontology querying and reasoning systems....
136
click to vote
AAAI
1992
15 years 7 months ago
1992
est case using an abstraction hierarchy in problem-solving can yield an exponential speed-up in search e ciency. Such a speed-up is predicted by various analytical models develope...
150
click to vote
TON
2002
15 years 5 months ago
2002
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
117
Voted
MA
2010
Springer
15 years 4 months ago
2010
Springer
We equip the polytope of n × n Markov matrices with the normalized trace of the Lebesgue measure of Rn2 . This probability space provides random Markov matrices, with i.i.d. rows...
160
Voted
CONCUR
1999
Springer
15 years 10 months ago
1999
Springer
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...