UW Theory Seminar, Prof. Pearl on "Shifting Algorithms for Tree Partitioning"

Article View: ont.events

Article #342

#342

From: utzoowatmathmwangpay
Date: Tue, 06 Jul 1982 09:21

25 lines
1305 bytes

               DEPARTMENT OF COMPUTER SCIENCE
               UNIVERSITY OF WATERLOO
               SEMINAR ACTIVITIES

               THEORY SEMINAR -  Thursday, July 15, 1982.

               Prof. J. Pearl, currently a Visiting Professor of the
               University  of Toronto, will speak on "Shifting Algo-
               rithms for Tree Partitioning."

               TIME:  3:30 PM

               ROOM:  M&C 5158

               ABSTRACT

               The technique of shifting algorithms for problems  of
               partitioning a tree is introduced.  This greedy tech-
               nique is applying a top-down approach using local de-
               cisions  at  each  step until the optimum solution is
               obtained.  The problems of MAX-MIN and  MIN-MAX  with
               generalizations are solved.

                        July 6, 1982

Technical Details

Message-ID: <bnews.watmath.2946>

Path: arc1-ca.pugleaf.net!unknown!not-for-mail

Show Full Headers

Complete Article Headers

From: utzoo!watmath!mwang_pay
Newsgroups: ont.events
Title: UW Theory Seminar, Prof. Pearl on "Shifting Algorithms for Tree Partitioning"
Article-I.D.: watmath.2946
Posted: Tue Jul  6 09:21:58 1982
Received: Thu Jul  8 03:45:06 1982
Subject: UW Theory Seminar, Prof. Pearl on "Shifting Algorithms for Tree Partitioning"
Date: Tue, 06 Jul 1982 09:21:58 +0000
Message-ID: <bnews.watmath.2946>