🚀 go-pugleaf

Los Angeles (LA) Association for Computing Machinery (ACM)
Technical Activity Committee on Artificial Intelligence (TACART)

             TACART

TOPIC:       State-Space Search: Algorithms, Complexity,
                 Phase Transitions and Applications

SPEAKER:     Dr. Weixiong (Wayne) Zhang
             University of Southern California 
             Information Sciences Institute

DATE:        16 October 1996 (Wednesday night)

TIME:        The talk will begin at 7:30.

PLACE:       Loyola Marymount University, Pereira Hall 27.
             LMU is located at Loyola Blvd. and 80th Street in
             Westchester. From the 405, take the Manchester exit
             and proceed west to Loyola Blvd.  Turn north, and
             continue until you enter the LMU campus.  Ask the
             guard for directions to Pereira Hall. Parking is free.

ABSTRACT:    Dr. Zhang will briefly describe three well-known search
             algorithms: best-first search, depth-first branch-and-bound,
             iterative deepening, then discuss their average-case complexity.
             Recent analytic results indicate that there are dramatic and 
             abrupt phase transitions in complexity, from exponential to 
             polynomial, in terms of search depth. He will demonstrate these 
             for the Traveling Salesman Problem, and will present a new method 
             for solving NP-hard combinatorial optimization problems based on
             these ideas. The new method can find approximate solutions
             quickly, and optimal solutions earlier. A game search method
             application will be described if time permits.

BIOGRAPHY:   WAYNE ZHANG is a Research Scientist at USC/ISI, and a Research
             Assistant Professor at USC.  He received his M.S. (1991) and  
             Ph.D. (1994) from UCLA. His areas of research include heuristic 
             search, planning, distributed multiagent systems, and data mining 
             in artificial intelligence; combinatorial optimization, parallel
             and distributed computing; and robot planning and programming.
             He has published more than 30 journal and conference papers,
             and is currently completing a book on problem solving and
             heuristic search that will be published in 1997.

DINNER:      No dinner is planned.  No social activities are planned.
NEWSGROUPS:  Announced in comp.ai, la.seminars, ca.seminars.
HOMEPAGE:    http://kecksvr.eng.lmu.edu/TACART.html (under repair).
CONTACTS:    L. Andrew Campbell campbell@aero.org (310) 336-8642 or
             Program Chair Barney Toma tomab@ecn.com (310) 323-8451.
-- 
 zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz
| L. Andrew Campbell     internet: campbell@aero.org       |
| M1-102 PO Box 92957    organization: The Aerospace Corp. |
| Los Angeles CA 90009   telephone: (310) 336-8642         |