1983 search results - page 187 / 397 » Competitive graph searches |
FMCAD
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we present a complete method for verifying properties expressed in the temporal logic CTL. In contrast to the majority of verification methods presented in recent yea...
ATMOS
2010
13 years 7 months ago
2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Along with the blossom of open source projects comes the convenience for software plagiarism. A company, if less self-disciplined, may be tempted to plagiarize some open source pr...