Computer Society Chapter Meeting Notice
| October 17, 2011 | Posted by Frank Gomez under CS |
Comments off
|
Scheduled for Thursday, October 27, 2011
IEEE Foothill Section
Computer Society Chapter Meeting
Location:
Cal Poly Pomona Bronco Student Center Bldg. 35,
Room Orion C-2315 Hollow Square
3801 W. Temple Ave., Pomona, CA 91768
Visitor parking available in Lot C, near the Library Bldg. 15
$5 parking
Campus Map: http://dsa.csupomona.edu/parking/files/pay_station_map_0201_2011_7543.pdf
Agenda:
6:00 PM – 6:45 PM Networking – Refreshments provided
6:45 PM – 7:00 PM Chapter Meeting – 2012 Officer Election
7:00 PM – 8:30 PM Presentation/Lecture – Topic: ZDD (Zero-suppressed binary Decision Diagrams)
Speaker: Dr. Patrice Brémond-Grégoire,
Lecturer at Cal Poly Pomona
30+ years of experience in the software development industry, worked in all diverse fields of software development, ranging from microcode for custom processors to operating systems, including compilers, networking protocols, etc. The lecture will provide a basic understanding of ZDD and how they can be used to solve combinatorial problems.
Event Sponsored by
IEEE Student Chapter of Cal Poly Pomona &
IEEE Foothill Section
For questions, contact c.vasquez-carrera@computer.org
Dr. Patrice Bremond-Gregoire has over 30 years of experience in the software development industry, during which he worked in all diverse fields of software development, ranging from microcode for custom processors to operating systems, including compilers, networking protocols, as well as Internationalization and QA Automation. He is the founder and president of BGE, Inc. an Independent Software Vendor who specializes in business software integrated with Microsoft Dynamics ERP package. He also teaches Object Oriented Design and Programming and Symbolic Programming at Cal Poly Pomona. Patrice holds a Ph.D. in Computer Science from the University of Pennsylvania.
Lecture Overview
ZDD or Zero-suppressed binary Decision Diagrams are a form of Binary Decision Diagrams where all zero (a.k.a. bottom) nodes are collapsed. ZDD can be efficiently represented and manipulated by computer programs. The purpose of this lecture is to provide a basic understanding of ZDD and how they can be used to solve combinatorial problems. It includes a definition of ZDD and an overview of the operations that can be performed on them, as well as examples of problems that can be efficiently solved using them.