|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 643 occurrences of 451 keywords
|
|
|
Results
Found 866 publication records. Showing 866 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
47 | Alain Cournier, Stéphane Devismes, Franck Petit, Vincent Villain |
Snap-Stabilizing Depth-First Search on Arbitrary Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems, 8th International Conference, OPODIS 2004, Grenoble, France, December 15-17, 2004, Revised Selected Papers, pp. 267-282, 2004, Springer, 3-540-27324-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
fault-tolerance, Distributed systems, stabilization, depth-first search |
45 | Hector Ouilhet |
Google Sky Map: using your phone as an interface. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mobile HCI ![In: Proceedings of the 12th Conference on Human-Computer Interaction with Mobile Devices and Services, Mobile HCI 2010, Lisbon, Portugal, September 7-10, 2010, pp. 419-422, 2010, ACM, 978-1-60558-835-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
43 | Ming-Syan Chen, Kang G. Shin |
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 1(2), pp. 152-159, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
obstructed node, performance evaluation, performance, fault tolerant computing, multiprocessor interconnection networks, multiprocessing systems, Hamming distance, fault-tolerant routing, depth-first search, hypercube multicomputers, destination node, component failures |
42 | Lakshmanan Kuppusamy, Kamala Krithivasan |
On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2009, 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009. Proceedings, pp. 246-260, 2009, Springer, 978-3-642-03465-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
internal contextual grammars, maximal, incomparable, depth-first |
42 | Qunxiong Zhu, Xiaoyong Lin |
Depth First Generation of Frequent Patterns Without Candidate Generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD Workshops ![In: Emerging Technologies in Knowledge Discovery and Data Mining, PAKDD 2007, International Workshops, Nanjing, China, May 22-25, 2007, Revised Selected Papers, pp. 378-388, 2007, Springer, 978-3-540-77016-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Data mining, Frequent pattern mining, Top-down, Depth first |
42 | Dragan Bosnacki |
A Nested Depth First Search Algorithm for Model Checking with Symmetry Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORTE ![In: Formal Techniques for Networked and Distributed Systems - FORTE 2002, 22nd IFIP WG 6.1 International Conference Houston, Texas, USA, November 11-14, 2002, Proceedings, pp. 65-80, 2002, Springer, 3-540-00141-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
state space reduction techniques, nested depth first search algorithm, multiple representatives, Model checking, symmetry reduction |
38 | Jeremy T. Engle, Edward L. Robertson |
Depth first algorithms and inferencing for AFD mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDEAS ![In: International Database Engineering and Applications Symposium (IDEAS 2009), September 16-18, 2009, Cetraro, Calabria, Italy, pp. 54-65, 2009, ACM, 978-1-60558-402-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Lozenge Search, approximate functional dependencies, powerset lattices, data mining, depth first search |
38 | Zhenjiang Li, J. J. Garcia-Luna-Aceves |
Finding multi-constrained feasible paths by using depth-first search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Wirel. Networks ![In: Wirel. Networks 13(3), pp. 323-334, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Multi-constrained path selection, Success ratio, Existence percentage, Competitive ratio, Depth-first search |
38 | Jop F. Sibeyn, James Abello, Ulrich Meyer 0001 |
Heuristics for semi-external depth first search on directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002, pp. 282-292, 2002, ACM, 1-58113-529-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
strong components, graph algorithms, depth first search, external memory |
38 | Chen-Hsing Peng, Biing-Feng Wang, Jia-Shung Wang |
Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 11(6), pp. 559-570, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Depth-first search trees, parallel algorithms, spanning trees, PRAM, the Euler-tour technique |
38 | Jia-Shung Wang, Biing-Feng Wang, Chen-Hsing Peng |
Recognizing depth-first-search trees in parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 101-105, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
depth-first-search trees, parallel algorithms, parallel algorithm, computational complexity, directed graphs, time complexity, spanning tree, search problems, undirected graph, tree searching, speed-up, EREW PRAM model |
38 | Daniel R. Fuhrmann |
Quadtree Traversal Algorithms for Pointer-Based and Depth-First Representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 10(6), pp. 955-960, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
depth-first representations, quadtree traversal algorithms, pointer-based representations, data structure, computerised picture processing, computerised pattern recognition, trees (mathematics), nodes, computerized pattern recognition, computerized picture processing, connected-component labeling |
37 | Hanan Samet |
K-Nearest Neighbor Finding Using MaxNearestDist. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 30(2), pp. 243-252, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
depth-first nearest neighbor finding, best-first nearest neighbor finding, similarity searching, k-nearest neighbors, metric spaces |
37 | Chee Fen Yu, Benjamin W. Wah |
Efficient Branch-and-Bound Algorithms on a Two-Level Memory System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 14(9), pp. 1342-1356, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
two-level memory system, storage management, virtual-memory, storage allocation, depth-first search, branch-and-bound algorithms, virtual storage, best-first search |
35 | Lars Arge, Ulrich Meyer 0001, Laura Toma, Norbert Zeh |
On External-Memory Planar Depth First Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings, pp. 471-482, 2001, Springer, 3-540-42423-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
31 | Lakshmanan Kuppusamy |
End-Marked Maximal Depth-First Contextual Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings, pp. 339-350, 2006, Springer, 3-540-35428-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Alexander Reinefeld, T. Anthony Marsland |
Enhanced Iterative-Deepening Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(7), pp. 701-710, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
iterative-deepening search, breadth-first node expansion, successively extended search horizons, information management techniques, fast-execution memory functions, computational complexity, game theory, iterative methods, search problems, space complexity, depth-first searches, A* search, search efficiency, best-first searches, two-player games |
30 | David Faragó, Peter H. Schmitt |
Improving Non-Progress Cycle Checks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIN ![In: Model Checking Software, 16th International SPIN Workshop, Grenoble, France, June 26-28, 2009. Proceedings, pp. 50-67, 2009, Springer, 978-3-642-02651-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Non-progress cycles, Model Checking, SPIN, partial order reduction, depth-first search, livelocks |
30 | Roland Ducournau, Michel Habib |
On Some Algorithms for Multiple Inheritance in Object-Oriented Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECOOP ![In: ECOOP'87 European Conference on Object-Oriented Programming, Paris, France, June 15-17, 1987, Proceedings, pp. 243-252, 1987, Springer, 3-540-18353-1. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
inheritance with exceptions, Object oriented language, depth-first-search, partial ordered sets, multiple inheritance, linear extensions |
27 | Mohamed Naimi |
Parallel assignment to distinct identities in arbitrary networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCN ![In: Proceedings of the 4th International Conference on Computer Communications and Networks (ICCCN '95), September 20-23, 1995, Las Vegas, Nevada, USA, pp. 475, 1995, IEEE Computer Society, 0-8186-7180-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
sequential distributed algorithm, parallel assignment, distinct identities, parallel distributed algorithm, distributed system nodes, initiator channel, children channel, outgoing channels, upper bound time transmission, parallel algorithms, multiprocessor interconnection networks, time complexity, communication complexity, spanning tree, depth-first search, network diameter, rooted tree, arbitrary network, synchronous distributed systems |
27 | Yannis E. Ioannidis, Raghu Ramakrishnan 0001, Linda Winger |
Transitive Closure Algorithms Based on Graph Traversal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 18(3), pp. 512-576, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
node reachability, transitive closure, depth-first search, path computations |
26 | Sumit Kumar Bose, Subir Bhattacharya |
A two pass heuristic algorithm for scheduling 'blocked out' units in continuous process industry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 159(1), pp. 293-313, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Depth first branch and bound, Continuous processing, Heuristic search, Process scheduling |
26 | Renata Braga Araújo, Guilherme Henrique Trielli Ferreira, Gustavo Henrique Orair, Wagner Meira Jr., Renato Antônio Celso Ferreira, Dorgival Olavo Guedes Neto, Mohammed Javeed Zaki |
The ParTriCluster Algorithm for Gene Expression Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Parallel Program. ![In: Int. J. Parallel Program. 36(2), pp. 226-249, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Clustering, Parallel programming, Bioinformatics, Depth-first search |
26 | Yonghong Chen, Xing Liu, Vaithianathan Mani Venkatasubramanian |
Fast Algorithms for Detecting Circular VAR Flows in Large Power-Flow Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS ![In: 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), Proceedings, 7-10 January 2008, Waikoloa, Big Island, HI, USA, pp. 170, 2008, IEEE Computer Society, 0-7695-3075-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Loop flows, power-flow studies, Directed graphs, depth-first search, electric power system |
26 | Hiroki Arimura, Takeaki Uno, Shinichi Shimozono |
Time and Space Efficient Discovery of Maximal Geometric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, 10th International Conference, DS 2007, Sendai, Japan, October 1-4, 2007, Proceedings, pp. 42-55, 2007, Springer, 978-3-540-75487-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
closed graph mining, rightmost expansion, polynomial delay polynomial space enumeration algorithms, depth-first search, geometric graphs |
26 | Shimin Chen, Phillip B. Gibbons, Michael Kozuch, Vasileios Liaskovitis, Anastassia Ailamaki, Guy E. Blelloch, Babak Falsafi, Limor Fix, Nikos Hardavellas, Todd C. Mowry, Chris Wilkerson |
Scheduling threads for constructive cache sharing on CMPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, pp. 105-115, 2007, ACM, 978-1-59593-667-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
constructive cache sharing, parallel depth first, thread granularity, working set profiling, chip multiprocessors, scheduling algorithms, work stealing |
26 | Jiyuan An, Yi-Ping Phoebe Chen |
Finding Short Patterns to Classify Text Documents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Web Intelligence ![In: 2006 IEEE / WIC / ACM International Conference on Web Intelligence (WI 2006), 18-22 December 2006, Hong Kong, China, pp. 293-296, 2006, IEEE Computer Society, 0-7695-2747-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
rule generation, Document Categorization, breadth-first, depth-first |
26 | Mhand Hifi |
Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 8(1), pp. 65-84, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
dynamic programming, heuristics, hill-climbing, depth-first search, knapsacking, cutting stock |
25 | Roman Barták, Hana Rudová |
Limited assignments: a new cutoff strategy for incomplete depth-first search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, March 13-17, 2005, pp. 388-392, 2005, ACM, 1-58113-964-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
search, constraint satisfaction |
25 | Panagiota Fatourou |
Low-contention depth-first scheduling of parallel computations with write-once synchronization variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001, pp. 189-198, 2001, ACM, 1-58113-409-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Hideyuki Ohtani, Takuya Kida, Takeaki Uno, Hiroki Arimura |
Efficient serial episode mining with minimal occurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICUIMC ![In: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, ICUIMC 2009, Suwon, Korea, January 15-16, 2009, pp. 457-464, 2009, ACM, 978-1-60558-405-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
closed sequences, depth-first algorithm, frequent episode mining |
25 | Tamjidul Hoque, Madhu Chetty, Andrew Lewis, Abdul Sattar 0001 |
DFS Based Partial Pathways in GA for Protein Structure Prediction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRIB ![In: Pattern Recognition in Bioinformatics, Third IAPR International Conference, PRIB 2008, Melbourne, Australia, October 15-17, 2008. Proceedings, pp. 41-53, 2008, Springer, 978-3-540-88434-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
genetic algorithm, protein structure prediction, Depth-first search, lattice model |
25 | Wen-Li Wang, Mei-Huei Tang |
User-Oriented Reliability Modeling for a Web System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSRE ![In: 14th International Symposium on Software Reliability Engineering (ISSRE 2003), 17-20 November 2003, Denver, CO, USA, pp. 293-306, 2003, IEEE Computer Society, 0-7695-2007-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
User-Oriented Reliability Modeling, Transition Tree, Depth-First Traversal, Dynamic Programming, Flow Graph, Cyclomatic Complexity |
25 | Clifton Davis, Christoph F. Eick |
A heuristic search based factoring tool. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), 13-15 November 2000, Vancouver, BC, Canada, pp. 298-, 2000, IEEE Computer Society, 0-7695-0909-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
heuristic search based factoring tool, RSA cryptography, state-based search, heuristic formula, pseudo-smooth integers, security, cryptography, heuristic programming, depth first search, tree searching |
25 | Raul H. C. Lopes, Mark Tarver |
Inducing Theorem Provers from Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 9th International Conference on Tools with Artificial Intelligence, ICTAI '97, Newport Beach, CA, USA, November 3-8, 1997, pp. 157-164, 1997, IEEE Computer Society, 0-8186-8203-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
theorem prover induction, automatic theorem prover generation, proof examples, intuitionistic propositional calculus, depth-first search strategy, loop detection, inductive generalization, machine learning, theorem proving |
25 | Achim Weigel, S. Baumann, J. Rohrschneider |
Lexical postprocessing by heuristic search and automatic determination of the edit costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Third International Conference on Document Analysis and Recognition, ICDAR 1995, August 14 - 15, 1995, Montreal, Canada. Volume II, pp. 857-860, 1995, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
lexical postprocessing, edit costs determination, dictionary based lexical postprocessing, character hypotheses lattice, weighted edit distance, best word search, depth first traversal, iterative supervised automatic learning algorithm, character recognition, heuristic search, vocabulary, recognition rate, segmentation algorithm |
25 | Matthew S. Hecht, Jeffrey D. Ullman |
Analysis of a Simple Algorithm for Global Flow Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the ACM Symposium on Principles of Programming Languages, Boston, Massachusetts, USA, October 1973, pp. 207-217, 1973, ACM Press. The full citation details ...](Pics/full.jpeg) |
1973 |
DBLP DOI BibTeX RDF |
available expressions, depth-first spanning tree, global data flow analysis, live variables, reducibility, dominance, code optimization, interval analysis, flow graph |
25 | Jakob Marolt, Simona Sinko, Tone Lerher |
Model of a multiple-deep automated vehicles storage and retrieval system following the combination of Depth-First storage and Depth-First relocation strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Prod. Res. ![In: Int. J. Prod. Res. 61(15), pp. 4991-5008, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Russell L. Shackelford, Richard J. LeBlanc |
Integrating "depth first" and "breadth first" models of computing curricula. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 25th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 1994, Phoenix, Arizona, USA, March 10-12, 1994, pp. 6-10, 1994, ACM, 0-89791-646-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Pilar de la Torre, Clyde P. Kruskal |
Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 34(4), pp. 275-298, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Pilar de la Torre, Clyde P. Kruskal |
Fast and Efficient Parallel Algorithms for Single Source Lexicographic Depth-First Breadth-First Search and Topological-First Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP (3) ![In: Proceedings of the International Conference on Parallel Processing, ICPP '91, Austin, Texas, USA, August 1991. Volume III: Algorithms and Applications., pp. 286-287, 1991, CRC Press. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP BibTeX RDF |
|
24 | Yugang Jia, Christophe Andrieu, Robert J. Piechocki, Magnus Sandell |
Depth-First and Breadth-First Search Based Multilevel SGA Algorithms for Near Optimal Symbol Detection in MIMO Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 7(3), pp. 1052-1061, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | William Yeoh 0001, Ariel Felner, Sven Koenig |
IDB-ADOPT: A Depth-First Search DCOP Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSCLP ![In: Recent Advances in Constraints, 13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008, Rome, Italy, June 18-20, 2008, Revised Selected Papers, pp. 132-146, 2008, Springer, 978-3-642-03250-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Distributed Search Algorithms, ADOPT, Distributed Constraint Optimization, DCOP |
22 | Girija J. Narlikar |
Scheduling Threads for Low Space Requirement and Good Locality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 35(2), pp. 151-187, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
22 | Franck Petit, Vincent Villain |
Color Optimal Self-Stabilizing Depth-First Token Circulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 18-20 December 1997, Taipei, Taiwan, pp. 317-323, 1997, IEEE Computer Society, 0-8186-8259-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
fault-tolerance, distributed systems, self-stabilization, mutual-exclusion, spanning trees, token circulation |
22 | Qiusun Ye |
Realization of Depth-first Search Based AI Properties of VCR. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WKDD ![In: Proceedings of the Second International Workshop on Knowledge Discovery and Data Mining, WKDD 2009, Moscow, Russia, 23-25 January 2009, pp. 829-832, 2009, IEEE Computer Society, 978-0-7695-3543-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Franck Petit |
Fast Self-Stabilizing Depth-First Token Circulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSS ![In: Self-Stabilizing Systems, 5th International Workshop, WSS 2001, Lisbon, Portugal, October 1-2, 2001, Proceedings, pp. 200-215, 2001, Springer, 3-540-42653-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | David J. King, John Launchbury |
Structuring Depth-First Search Algorithms in Haskell. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California, USA, January 23-25, 1995, pp. 344-354, 1995, ACM Press, 0-89791-692-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Haskell |
21 | Mary Micco |
An undergraduate curriculum in expert systems design or knowledge engineering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the 15th ACM Annual Conference on Computer Science, St. Louis, Missouri, USA, February 16-19, 1987, pp. 36-39, 1987, ACM, 0-89791-218-7. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
21 | Wilhelmiina Hämäläinen |
Lift-based search for significant dependencies in dense data sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD Workshop on Statistical and Relational Learning in Bioinformatics ![In: Proceedings of the ACM SIGKDD Workshop on Statistical and Relational Learning in Bioinformatics, Paris, France, June 28, 2009, pp. 12-16, 2009, ACM, 978-1-60558-667-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
association rules, redundancy, dependency analysis, depth-first search, statistical significance |
21 | Maofu Liu, Wenjie Li 0002, Xiaolong Zhang, Ji Zhang |
Event-Based Summarization Using Critical Temporal Event Term Chain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCPOL ![In: Computer Processing of Oriental Languages. Language Technology for the Knowledge-based Economy, 22nd International Conference, ICCPOL 2009, Hong Kong, March 26-27, 2009. Proceedings, pp. 378-385, 2009, Springer, 978-3-642-00830-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Event-Based Summarization, Event Term Graph, Temporal Event Term Chain, Depth-First Search Algorithm |
21 | Rajneesh Hegde |
Finding 3-shredders efficiently. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(1), pp. 14-43, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
four-connected, shredder, vertex cut, Depth-first search |
21 | Roderick Bloem, Harold N. Gabow, Fabio Somenzi |
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 28(1), pp. 37-56, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
language emptiness, Büchi automata, Streett automata, model checking, binary decision diagrams, depth-first search, breadth-first search, strongly connected components, symbolic algorithms |
21 | Shirish Tatikonda, Srinivasan Parthasarathy 0001, Tahsin M. Kurç |
TRIPS and TIDES: new algorithms for tree mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, Arlington, Virginia, USA, November 6-11, 2006, pp. 455-464, 2006, ACM, 1-59593-433-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Prufer sequences, depth first order codes, embedding lists, frequent patterns, tree mining |
21 | Chen-Yong Cher, Antony L. Hosking, T. N. Vijaykumar |
Software prefetching for mark-sweep garbage collection: hardware analysis and software redesign. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASPLOS ![In: Proceedings of the 11th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2004, Boston, MA, USA, October 7-13, 2004, pp. 199-210, 2004, ACM, 1-58113-804-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
buffered prefetch, prefetch-on-grey, garbage collection, prefetching, cache architecture, breadth-first, mark-sweep, depth-first |
21 | Thomas Erlebach, Torben Hagerup |
Routing Flow Through a Strongly Connected Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(3), pp. 467-473, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Feasible-flow problem, Strongly connected graph, Network flow, Analysis of algorithms, Depth-first search, Maximum-flow problem |
21 | Art Kazmierczak, Sridhar Radhakrishnan |
An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 11(2), pp. 110-118, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
biconnectivity testing, outerplanarity testing, Distributed algorithm, message complexity, depth first search, ear decomposition |
21 | Juan-Carlos Amengual, Enrique Vidal 0001 |
Efficient Error-Correcting Viterbi Parsing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 20(10), pp. 1109-1116, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Error-correcting parsing, depth-first topological sort, bucketsort, priority queues, sequence alignment, shape recognition, Viterbi algorithm, language processing, beam search |
21 | Valery M. Chelnokov, Victoria L. Zephyrova |
Collective Phenomena in Hypertext Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Hypertext ![In: Hypertext 97, The Eigth ACM Conference on Hypertext, University of Southampton, UK, April 6-11, 1997, pp. 220-221, 1997, ACM, 0-89791-866-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
SMIsC, cluster of meaning formed by hypertext nodes, coherent navigation, collective phenomena in populations of hypertext nodes, discourse macrostructure, discourse semantic coherence, hypertext statics and dynamics, hypertext-node macrostatus, spreading-activation search, Internet, Internet, depth-first search |
21 | Nader Bagherzadeh, Nayla Nassif, Shahram Latifi |
A Routing and Broadcasting Scheme on Faulty Star Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(11), pp. 1398-1403, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
faulty star graphs, backtracking technique, faulty links, performance analysis, distributed algorithms, fault tolerant computing, shortest path, depth first search, routing scheme, optimal path, broadcasting scheme |
21 | Michel Billaud |
Axiomatizations of Backtracking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings, pp. 71-82, 1992, Springer, 3-540-55210-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
foundations of logic programming, equivalence of program schemes, Prolog, backtracking, depth-first search, algebraic semantics, semantics of programming languages |
21 | Ming-Syan Chen, Kang G. Shin |
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 39(12), pp. 1406-1416, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
adaptive fault tolerant routing, fault tolerant computing, multiprocessor interconnection networks, depth-first search, hypercube multicomputers |
21 | Shimon Even, Ami Litman, Peter Winkler 0001 |
Computing with Snakes in Directed Networks of Automata (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 740-745, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
snakes', waking up, smart spanning trees, firing squad synchronization, protocols, finite-state automata, reporting, directed networks, breadth-first, depth-first |
21 | Philip N. Klein |
Efficient Parallel Algorithms for Chordal Graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 150-161, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
elimination ordering, optimal coloring, breadth-first search tree, depth-first search tree, parallel algorithms, interval graphs, chordal graphs, isomorphism, maximum independent set, maximum clique |
21 | Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya |
Sublinear-Time Parallel Algorithms for Matching and Related Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 174-185, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
sublinear-time parallel algorithms, maximal node-disjoint paths, zero-one networks, matching, depth-first search, node-disjoint paths, combinatorial structure |
21 | Sukhamay Kundu |
An O(V) algorithm M for computing transitive reduction of a planar acyclic digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 20th Annual Southeast Regional Conference, 1982, Knoxville, Tennessee, USA, April 1-3, 1982, pp. 29, 1982, ACM, 0-89791-071-0. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
planar digraph, transitive reduction, algorithm, depth-first search |
20 | Micah Adler, Brent Heeringa |
Search Space Reductions for Nearest-Neighbor Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings, pp. 554-567, 2008, Springer, 978-3-540-79227-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Ivan Stojmenovic, Mark Russell, Bosko Vukojevic |
Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: Proceedings of the 2000 International Conference on Parallel Processing, ICPP 2000, Toronto, Canada, August 21-24, 2000, pp. 173-180, 2000, IEEE Computer Society, 0-7695-0768-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Takashi Hirayama, Yasuaki Nishitani |
Efficient Search Methods for Obtaining Exact Minimum AND-EXOR Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DELTA ![In: Third IEEE International Workshop on Electronic Design, Test and Applications (DELTA 2006), 17-19 January 2006, Kuala Lumpur, Malaysia, pp. 137-142, 2006, IEEE Computer Society, 0-7695-2500-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Yoshikazu Shima, Kouichi Hirata, Masateru Harao |
Extraction of Frequent Few-Overlapped Monotone DNF Formulas with Depth-First Pruning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia Conference, PAKDD 2005, Hanoi, Vietnam, May 18-20, 2005, Proceedings, pp. 50-60, 2005, Springer, 3-540-26076-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Armand Prieditis |
Depth-First Branch-and-Bound vs. Depth-Bounded IDA*. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Intell. ![In: Comput. Intell. 14(2), pp. 188-206, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Neha Rungta, Eric G. Mercer |
Generating Counter-Examples Through Randomized Guided Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIN ![In: Model Checking Software, 14th International SPIN Workshop, Berlin, Germany, July 1-3, 2007, Proceedings, pp. 39-57, 2007, Springer, 978-3-540-73369-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Lars Arge, Norbert Zeh |
I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 261-270, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Andras Ferenczi, Costin Badica |
An Implementation of Depth-First and Breadth-First Search Algorithms for Tip Selection in IOTA Distributed Ledger. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACIIDS (1) ![In: Intelligent Information and Database Systems - 14th Asian Conference, ACIIDS 2022, Ho Chi Minh City, Vietnam, November 28-30, 2022, Proceedings, Part I, pp. 351-363, 2022, Springer, 978-3-031-21742-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Ziyu Chen, Chen He, Zhen He, Minyou Chen |
BD-ADOPT: a hybrid DCOP algorithm with best-first and depth-first search strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. Rev. ![In: Artif. Intell. Rev. 50(2), pp. 161-199, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Thaer Samar, Myriam C. Traub, Jacco van Ossenbruggen, Arjen P. de Vries |
Comparing Topic Coverage in Breadth-First and Depth-First Crawls Using Anchor Texts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPDL ![In: Research and Advanced Technology for Digital Libraries - 20th International Conference on Theory and Practice of Digital Libraries, TPDL 2016, Hannover, Germany, September 5-9, 2016, Proceedings, pp. 133-146, 2016, Springer, 978-3-319-43996-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
18 | Emir Zunic, Almir Djedovic, B. Zunic |
Software solution for optimal planning of sales persons work based on Depth-First Search and Breadth-First Search algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MIPRO ![In: 39th International Convention on Information and Communication Technology, Electronics and Microelectronics, MIPRO 2016, Opatija, Croatia, May 30 - June 3, 2016, pp. 1248-1253, 2016, IEEE, 978-953-233-086-1. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
18 | Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin |
Best-First and Depth-First Minimax Search in Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1505.01603, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
18 | Jianmin Zhang, Weixia Xu, Jun Zhang, ShengYu Shen, Zhengbin Pang, Tiejun Li, Jun Xia, Sikun Li |
Finding First-Order Minimal Unsatisfiable Cores with a Heuristic Depth-First-Search Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDEAL ![In: Intelligent Data Engineering and Automated Learning - IDEAL 2011 - 12th International Conference, Norwich, UK, September 7-9, 2011. Proceedings, pp. 178-185, 2011, Springer, 978-3-642-23877-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Radu Marinescu 0002 |
Best-First vs. Depth-First AND/OR Search for Multi-objective Constraint Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI (1) ![In: 22nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2010, Arras, France, 27-29 October 2010 - Volume 1, pp. 439-446, 2010, IEEE Computer Society, 978-0-7695-4263-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
18 | André Körbes, Roberto de Alencar Lotufo |
Analysis of the Watershed Algorithms Based on the Breadth-First and Depth-First Exploring Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIBGRAPI ![In: SIBGRAPI 2009, Proceedings of the XXII Brazilian Symposium on Computer Graphics and Image Processing, Rio de Janeiro, Brazil, 11-15 October 2009, pp. 133-140, 2009, IEEE Computer Society, 978-0-7695-3813-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Rong Zhou 0001, Eric A. Hansen |
Combining Breadth-First and Depth-First Strategies in Searching for Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009, pp. 640-645, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
18 | Andreas Auer, Hermann Kaindl |
A Case Study of Revisiting Best-First vs. Depth-First Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECAI ![In: Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI'2004, including Prestigious Applicants of Intelligent Systems, PAIS 2004, Valencia, Spain, August 22-27, 2004, pp. 141-145, 2004, IOS Press, 1-58603-452-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
18 | Thomas P. Murtagh |
Teacing breadth-first depth-first. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 6th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2001, Canterbury, UK, June 25-27, 2001, pp. 37-40, 2001, ACM, 1-58113-330-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
18 | Jens Clausen, Michael Perregaard |
On the best search strategy in parallel branch-and-bound: Best-First Search versus Lazy Depth-First Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 90, pp. 1-17, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
18 | Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan |
Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 49(1), pp. 45-50, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
18 | Jordi Tubella, Antonio González 0001 |
Combining depth-first and breadth-first search in Prolog execution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GULP-PRODE (2) ![In: 1994 Joint Conference on Declarative Programming, GULP-PRODE'94 Peñiscola, Spain, September 19-22, 1994, Volume 2, pp. 452-453, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
18 | Weixiong Zhang, Richard E. Korf |
Depth-First vs. Best-First Search: New Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Proceedings of the 11th National Conference on Artificial Intelligence. Washington, DC, USA, July 11-15, 1993., pp. 769-775, 1993, AAAI Press / The MIT Press, 0-262-51071-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP BibTeX RDF |
|
18 | Subir Bhattacharya, Amitava Bagchi |
QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWAR ![In: Automated Reasoning, Proceedings of the IFIP TC12/WG12.3 International Workshop on Automated Reasoning, Beijing, P.R. China, 13-16 July 1992, pp. 211-220, 1992, North-Holland, 0-444-89876-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
18 | Martin E. Dyer, Alan M. Frieze |
Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 2(2), pp. 233-240, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
18 | Nageshwara Rao Vempaty, Vipin Kumar 0001, Richard E. Korf |
Depth-First Versus Best-First Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Proceedings of the 9th National Conference on Artificial Intelligence, Anaheim, CA, USA, July 14-19, 1991, Volume 1., pp. 434-440, 1991, AAAI Press / The MIT Press, 0-262-51059-6. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP BibTeX RDF |
|
18 | Vasileios Liaskovitis, Shimin Chen, Phillip B. Gibbons, Anastassia Ailamaki, Guy E. Blelloch, Babak Falsafi, Limor Fix, Nikos Hardavellas, Michael Kozuch, Todd C. Mowry, Chris Wilkerson |
Parallel depth first vs. work stealing schedulers on CMP architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006, pp. 330, 2006, ACM, 1-59593-452-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
scheduling, caches, chip multiprocessors |
18 | Qinghua Zou, Wesley W. Chu, Baojing Lu |
SmartMiner: A Depth First Algorithm Guided by Tail Information for Mining Maximal Frequent Itemsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 9-12 December 2002, Maebashi City, Japan, pp. 570-577, 2002, IEEE Computer Society, 0-7695-1754-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
17 | Akihiro Kishimoto, Martin Müller 0003 |
About the Completeness of Depth-First Proof-Number Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computers and Games ![In: Computers and Games, 6th International Conference, CG 2008, Beijing, China, September 29 - October 1, 2008. Proceedings, pp. 146-156, 2008, Springer, 978-3-540-87607-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Jakub Pawlewicz, Lukasz Lew |
Improving Depth-First PN-Search: 1 + epsilon Trick. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computers and Games ![In: Computers and Games, 5th International Conference, CG 2006, Turin, Italy, May 29-31, 2006. Revised Papers, pp. 160-171, 2006, Springer, 978-3-540-75537-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
17 | Zhenjiang Li, J. J. Garcia-Luna-Aceves |
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QSHINE ![In: Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE 2005), 22-24 August 2005, Lake Buena Vista, FL, USA, pp. 15, 2005, IEEE Computer Society, 0-7695-2423-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Joxan Jaffar, Andrew E. Santosa, Roland H. C. Yap, Kenny Qili Zhu |
Scalable Distributed Depth-First Search with Greedy Work Stealing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 15-17 November 2004, Boca Raton, FL, USA, pp. 98-103, 2004, IEEE Computer Society, 0-7695-2236-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
17 | Walter A. Kosters, Wim Pijls, Viara Popova |
Complexity Analysis of Depth First and FP-Growth Implementations of APRIORI. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MLDM ![In: Machine Learning and Data Mining in Pattern Recognition, Third International Conference, MLDM 2003, Leipzig, Germany, July 5-7, 2003, Proceedings, pp. 284-292, 2003, Springer, 3-540-40504-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
17 | Hanan Samet |
Depth-first k-nearest neighbor finding using the MaxNearestDist estimator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIAP ![In: 12th International Conference on Image Analysis and Processing (ICIAP 2003), 17-19 September 2003, Mantova, Italy, pp. 486-491, 2003, IEEE Computer Society, 0-7695-1948-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
17 | Catharine M. Wyss, Chris Giannella, Edward L. Robertson |
FastFDs: A Heuristic-Driven, Depth-First Algorithm for Mining Functional Dependencies from Relation Instances - Extended Abstract. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DaWaK ![In: Data Warehousing and Knowledge Discovery, Third International Conference, DaWaK 2001, Munich, Germany, September 5-7, 2001, Proceedings, pp. 101-110, 2001, Springer, 3-540-42553-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 866 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ >>] |
|