Search: in all items in current results
Select / remove query terms:
Found 25074 results in 0.041 sec. (Time to generate facets: 0 sec.)
Pages: 1  2  3  4  5  6  7  8  9  10  >>
Randal E. Bryant: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. Computers (TC) 35(8):677-691 (1986)
Cited 2511 times
Avrim Blum, Merrick L. Furst: Fast Planning Through Planning Graph Analysis. Artif. Intell. (AI) 90(1-2):281-300 (1997)
Read article - Cited 774 times
Avrim Blum, Merrick L. Furst: Fast Planning Through Planning Graph Analysis. IJCAI 1995
Cited 774 times
Jeanne Ferrante, Karl J. Ottenstein, Joe D. Warren: The Program Dependence Graph and Its Use in Optimization. ACM Trans. Program. Lang. Syst. (TOPLAS) 9(3):319-349 (1987)
Read article - Cited 716 times
Jeanne Ferrante, Karl J. Ottenstein, Joe D. Warren: The program Dependence Graph and its Use in Optimization. Symposium on Programming (PROGRAMM) 1984
Cited 716 times
Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck: Efficiently Computing Static Single Assignment Form and the Control Dependence Graph. ACM Trans. Program. Lang. Syst. (TOPLAS) 13(4):451-490 (1991)
Read article - Cited 686 times
Susan Horwitz, Thomas W. Reps, David Binkley: Interprocedural Slicing Using Dependence Graphs. ACM Trans. Program. Lang. Syst. (TOPLAS) 12(1):26-60 (1990)
Read article - Cited 564 times
Susan Horwitz, Thomas W. Reps, David Binkley: Interprocedural Slicing Using Dependence Graphs PLDI 1988
Cited 564 times
Frank R. Kschischang, Brendan J. Frey, Hans-Andrea Loeliger: Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory (TIT) 47(2):498-519 (2001)
Cited 494 times
Yuri Boykov, Olga Veksler, Ramin Zabih: Fast Approximate Energy Minimization via Graph Cuts. IEEE Trans. Pattern Anal. Mach. Intell. (PAMI) 23(11):1222-1239 (2001)
Read article - Cited 477 times
Pages: 1  2  3  4  5  6  7  8  9  10  >>
Powered by Cloud Mining using the DBLP data.