Search for Author All Reviews
	Hans-Jörg, Kreowski     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 4 of 4 reviews       Dynamics in logistics: Third International Conference, LDIC 2012 Bremen, Germany, February/March 2012 Proceedings Kreowski H., Scholz-Reiter B., Thoben K., Springer International Publishing, New York, NY, 2015. 580 pp.  Type: Book (978-3-642426-94-0) This proceedings volume includes 51 papers on logistics that deal with tagging, planning, routing, and scheduling in the supply chain. The drivers for an increase of complexity in the supply chain start with factors that are actually o...... Jun 14 2016     Abstract hierarchical graph transformation Busatto G., Kreowski H., Kuske S. Mathematical Structures in Computer Science 15(4): 773-819, 2005.  Type: Article There are different models for structuring large graphs, and many rule-based graph transformation concepts. The authors develop a generic approach to describe transformations of hierarchical graphs independent of the underlying approac...... May 2 2006     Formal methods in software and systems modeling: essays dedicated to Hartmut Ehrig on the occasion of his 60th birthday (Lecture Notes in Computer Science 3393) Kreowski H., Montanari U., Orejas F., Rozenberg G., Taentzer G., Springer-Verlag New York, Inc., Secaucus, NJ, 2005. 413 pp.  Type: Book (9783540249368) This festschrift contains essays dedicated to Hartmut Ehrig, on the occasion of his sixtieth birthday. Ehrig’s methods originated in category theory, and were first applied in a graph-theoretic context. Now, they are omnipres...... Nov 10 2005     A sight-seeing tour of the computational landscape of graph transformation: an experiment with the shortest-paths algorithms Kreowski H. In Formal and natural computing. New York, NY: Springer-Verlag New York, Inc., 2002.  Type: Book Chapter This is a nicely written chapter on how to perform computations by rewriting graphs. Four different schemes for graphical computation are discussed. The first two schemes, one using a binary relation on graphs from initial graph to ter...... Aug 7 2003
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy