Topological Patterns for Scalable Representation and Analysis of Dataflow Graphs

By Sane Nimish  

Journal of Signal Processing Systems, Vol. 65, Iss. 2, 2011-11 ,pp. : 229-244

Springer Publishing Company

Access to resources Recommend Favorite

Parameterized Algorithms in Smooth 4-Regular Hamiltonian Graphs

By Mujuni Egbert  

Mathematics in Computer Science, Vol. 1, Iss. 4, 2008-06 ,pp. : 701-708

Springer Publishing Company

Access to resources Recommend Favorite

A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems

By Braun T.D.   Siegel H.J.   Beck N.   Bölöni L.L.   Maheswaran M.   Reuther A.I.   Robertson J.P.   Theys M.D.   Yao B.   Hensgen D.   Freund R.F.  

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 6, 2001-06 ,pp. : 810-837

Academic Press

Access to resources Recommend Favorite

Modular static scheduling of synchronous data-flow networks: An efficient symbolic representation

By Pouzet Marc   Raymond Pascal  

Design Automation for Embedded Systems, Vol. 14, Iss. 3, 2010-09 ,pp. : 165-192

Springer Publishing Company

Access to resources Recommend Favorite

Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms

By Chen J.   Kanj I.A.  

Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. : 833-847

Elsevier

Access to resources Recommend Favorite