612 search results - page 95 / 123 » Bounded model checking for knowledge and real time |
DLOG
2004
14 years 11 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
SDM
2010
SIAM
14 years 11 months ago
2010
SIAM
In social networks, nodes correspond to entities and edges to links between them. In most of the cases, nodes are also associated with a set of features. Noise, missing values or ...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
116
click to vote
KDD
2004
ACM
15 years 10 months ago
2004
ACM
In a wide range of business areas dealing with text data streams, including CRM, knowledge management, and Web monitoring services, it is an important issue to discover topic tren...