CISS'99 Conference Program



Session:

WA1

Shaffer 301

 

Algorithms

Chair

Gerald M. Masson, The Johns Hopkins University

9:00

(R)

Linear Matrix Inequalities With Uncertain Parameters: The Approximate Feasibility Concept

B.R. Barmish and P.S. Shcherbakov, University of Wisconsin, Madison

9:30

(R)

Efficient Global Optimization Using SPSA

John L. Maryak and Daniel C. Chin, The Johns Hopkins University, Applied Physics Laboratory

10:00

(R)

Certifying Branch-and-Bound Computations

Hongxia Jin, Gregory F. Sullivan and Gerald M. Masson, The Johns Hopkins University

10:30

COFFEE BREAK

10:45

(R)

Regular Buffered Sparse Crossbar Concentrators

Gokturk Ozer and A. Yavuz Oruc, University of Maryland , College Park

11:15

(R)

Crosspoint Complexity of Packet Switching Networks

Chien Lin and A. Yavuz Oruc, University of Maryland, College Park

11:45

(R)

A Nueral Net with Complex Weights: A Quantum Neural Net

   

B. Igelnik and M. Tabib-Azar, Case Western Reserve University

S.R. LeClair, Wright Laboratory




CISS'99 Home Page | CISS'99 Program | Next Session


Last updated on Feb 22, 1999, by Trac D. Tran
ciss99@ece.jhu.edu