4926 search results - page 304 / 986 » Two Graph Algorithms On an Associative Computing Model |
152
click to vote
CIKM
2010
Springer
15 years 3 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...
158
Voted
NOMS
2002
IEEE
15 years 10 months ago
2002
IEEE
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
139
click to vote
ICTAC
2004
Springer
15 years 10 months ago
2004
Springer
A model-based approach for minimization of test sets for interactive systems is introduced. Test cases are efficiently generated and selected to cover the behavioral model and the ...
158
click to vote
ICDE
2009
IEEE
15 years 12 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
199
click to vote
DAC
1994
ACM
15 years 8 months ago
1994
ACM
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...