9532 search results - page 62 / 1907 » Logic, Graphs, and Algorithms |
160
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...
150
click to vote
CADE
2010
Springer
15 years 5 months ago
2010
Springer
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncer...
153
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
134
Voted
APN
2004
Springer
15 years 9 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
126
Voted
WG
2010
Springer
15 years 2 months ago
2010
Springer
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...