en This file is an RSS 2.0 file. It is intended to be viewed in a Newsreader or syndicated to another site. http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-viror-strahasch-1032942679053 Es wird ein intuitives Verständnis von Algorithmischer Geometrie vermittelt. Dazu werden zunächst in einem kurzen historischen Abriss drei mögliche Zugänge zur Behandlung geometrischer Probleme vorgestellt: Der beweisorientierte , der axiomatische und der algorithmische Ansatz. Erläutert werden diese Ansätze jeweils durch historische Beispiele und zwar durch den Satz des Pythagoras für den beweisorientierten Ansatz, und der altägyptische Methode zur Berechnung des Flächeninhalts eines Kreises für den algorithmischen Ansatz. mar, 24 sep 2002 22:00:00 GMT http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-viror-strahasch-1032942679053 http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-eth-elaw-1007502928922 Preliminaries for algorithms and graphs (spanning trees, shortest paths, network flow); efficient algorithms for problems that can be solved optimally (e.g. multicast in WDM networks); efficientdata structures (e.g. lookup tables in IP-routers); approximation algorithms for network optimization problems (e.g. load balancing in ring networks, wavelength routing in WDM networks, restoration capacity planning); on-line algorithms that can make good decision in face of an unknown future (e.g. call admission control in QoS networks). For various types of problems, useful methods for the design of algorithms as well as meaningful techniques for evaluating them are presented.Objectives:Presentation of fundamental techniques for the design and analysis of algorithms for various applications in mmunication networks. lun, 03 dic 2001 23:00:00 GMT http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-eth-elaw-1007502928922 http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-eth-elaw-996148638207 This learning resource is a postscript/PDF file covering the theme addressed in the Title.Preliminaries for algorithms and graphs (spanning trees, shortest paths, network flow); efficient algorithms for problems that can be solved optimally (e.g. multicast in WDM networks); efficientdata structures (e.g. lookup tables in IP-routers); approximation algorithms for network optimization problems (e.g. load balancing in ring networks, wavelength routing in WDM networks, restoration capacity planning); on-line algorithms that can make good decision in face of an unknown future (e.g. call admission control in QoS networks). For various types of problems, useful methods for the design of algorithms as well as meaningful techniques for evaluating them are presented.Objectives:Presentation of fundamental techniques for the design and analysis of algorithms for various applications in mmunication networks. jue, 25 ene 2001 23:00:00 GMT http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-eth-elaw-996148638207 http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-eth-elaw-1007470003658 This learning resource is a postscript/PDF file covering the theme addressed in the Title.Preliminaries for algorithms and graphs (spanning trees, shortest paths, network flow); efficient algorithms for problems that can be solved optimally (e.g. multicast in WDM networks); efficientdata structures (e.g. lookup tables in IP-routers); approximation algorithms for network optimization problems (e.g. load balancing in ring networks, wavelength routing in WDM networks, restoration capacity planning); on-line algorithms that can make good decision in face of an unknown future (e.g. call admission control in QoS networks). For various types of problems, useful methods for the design of algorithms as well as meaningful techniques for evaluating them are presented.Objectives:Presentation of fundamental techniques for the design and analysis of algorithms for various applications in communication networks. jue, 25 ene 2001 23:00:00 GMT http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-eth-elaw-1007470003658 http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-eth-elaw-1007470049934 This learning resource is a postscript/PDF file covering the theme addressed in Title.Preliminaries for algorithms and graphs (spanning trees, shortest paths, network flow); efficient algorithms for problems that can be solved optimally (e.g. multicast in WDM networks); efficient data structures (e.g. lookup tables in IP-routers); approximation algorithms for network optimization problems (e.g. load balancing in ring networks, wavelength routing in WDM networks, restoration capacity planning); on-line algorithms that can make good decision in face of an unknown future (e.g. call admission control in QoS networks). For various types of problems, useful methods for the design of algorithms as well as meaningful techniques for evaluating them are presented.Objectives:Presentation of fundamental techniques for the design and analysis of algorithms for various applications in communication networks. jue, 25 ene 2001 23:00:00 GMT http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-eth-elaw-1007470049934 http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-eth-elaw-1007469556801 This learning resource is a postscript/PDF file covering the theme addressed in the Title.Preliminaries for algorithms and graphs (spanning trees, shortest paths, network flow); efficient algorithms for problems that can be solved optimally (e.g. multicast in WDM networks); efficientdata structures (e.g. lookup tables in IP-routers); approximation algorithms for network optimization problems (e.g. load balancing in ring networks, wavelength routing in WDM networks, restoration capacity planning); on-line algorithms that can make good decision in face of an unknown future (e.g. call admission control in QoS networks). For various types of problems, useful methods for the design of algorithms as well as meaningful techniques for evaluating them are presented.Objectives:Presentation of fundamental techniques for the design and analysis of algorithms for various applications in mmunication networks. jue, 25 ene 2001 23:00:00 GMT http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-eth-elaw-1007469556801 http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-eth-elaw-1007469871544 This learning resource is a postscript/PDF file covering the theme addressed in the Title.Preliminaries for algorithms and graphs (spanning trees, shortest paths, network flow); efficient algorithms for problems that can be solved optimally (e.g. multicast in WDM networks); efficientdata structures (e.g. lookup tables in IP-routers); approximation algorithms for network optimization problems (e.g. load balancing in ring networks, wavelength routing in WDM networks, restoration capacity planning); on-line algorithms that can make good decision in face of an unknown future (e.g. call admission control in QoS networks). For various types of problems, useful methods for the design of algorithms as well as meaningful techniques for evaluating them are presented.Objectives:Presentation of fundamental techniques for the design and analysis of algorithms for various applications in communication networks. jue, 25 ene 2001 23:00:00 GMT http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-eth-elaw-1007469871544 http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-eth-elaw-1007469917649 This learning resource is a postscript/PDF file covering the theme addressed in the Title.Preliminaries for algorithms and graphs (spanning trees, shortest paths, network flow); efficient algorithms for problems that can be solved optimally (e.g. multicast in WDM networks); efficientdata structures (e.g. lookup tables in IP-routers); approximation algorithms for network optimization problems (e.g. load balancing in ring networks, wavelength routing in WDM networks, restoration capacity planning); on-line algorithms that can make good decision in face of an unknown future (e.g. call admission control in QoS networks). For various types of problems, useful methods for the design of algorithms as well as meaningful techniques for evaluating them are presented.Objectives:Presentation of fundamental techniques for the design and analysis of algorithms for various applications in communication networks. jue, 25 ene 2001 23:00:00 GMT http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-eth-elaw-1007469917649 http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-eth-elaw-1007469967313 This learning resource is a postscript/PDF file covering the theme addressed in the title.Preliminaries for algorithms and graphs (spanning trees, shortest paths, network flow); efficient algorithms for problems that can be solved optimally (e.g. multicast in WDM networks); efficientdata structures (e.g. lookup tables in IP-routers); approximation algorithms for network optimization problems (e.g. load balancing in ring networks, wavelength routing in WDM networks, restoration capacity planning); on-line algorithms that can make good decision in face of an unknown future (e.g. call admission control in QoS networks). For various types of problems, useful methods for the design of algorithms as well as meaningful techniques for evaluating them are presented.Objectives:Presentation of fundamental techniques for the design and analysis of algorithms for various applications in communication networks. jue, 25 ene 2001 23:00:00 GMT http://www.educanext.org/ubp/search@srchDetailsLR?lrID=lr-eth-elaw-1007469967313