4355 search results - page 117 / 871 » Increasing Kolmogorov Complexity |
DLOG
2008
15 years 12 days ago
2008
Abstract. We investigate the concept product as an expressive feature for description logics (DLs). While this construct allows us to express an arguably very common and natural ty...
FORTE
2008
14 years 11 months ago
2008
Designing and interoperability testing of distributed, application-level network protocols is complex. Windows, for example, supports currently more than 200 protocols, ranging fro...
104
click to vote
IPM
2006
14 years 10 months ago
2006
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
103
click to vote
JODS
2007
14 years 10 months ago
2007
Abstract. A viable ontology engineering methodology requires supporting domain experts in gradually building and managing increasingly complex versions of ontological elements and ...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...