2010 International Conference on Distributed Computing Systems Optimizing the Spatio-Temporal Distribution of Cyber-Physical Systems for Environment Abstraction Linghe Kong, Dawei Jiang, Min-You Wu Shanghai Jiao Tong Un

First Page		Document Content
Date: 2015-04-14 12:01:50 Knowledge representation Search algorithms Network theory Mathematics Connectivity Tree Breadth-first search Discrete mathematics Combinatorics Networks Centrality		2010 International Conference on Distributed Computing Systems Optimizing the Spatio-Temporal Distribution of Cyber-Physical Systems for Environment Abstraction Linghe Kong, Dawei Jiang, Min-You Wu Shanghai Jiao Tong Un Add to Reading List Source URL: wirelesslab.sjtu.edu.cn Download Document from Source Website File Size: 766,28 KB Share Document on Facebook

	Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org ON DYNAMIC BREADTH-FIRST SEARCH IN EXTERNAL-MEMORY ULRICH MEYER 1 DocID: 1uYtC - View Document
	Information Processing Letters–229 www.elsevier.com/locate/ipl Salembier’s Min-tree algorithm turned into breadth first search Wim H. Hesselink Department of Mathematics and Computing Science, Rijksuniv DocID: 1uX4F - View Document
	Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search Scott Beamer EECS Department University of California Berkeley, California DocID: 1tfnh - View Document
	Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved DocID: 1rtvU - View Document
	6.006 Intro to Algorithms QUIZ 2 REVIEW NOTES - Part 2 April 12, 2011 DocID: 1rsoU - View Document