| 1996 |
|---|
| 7 | EE | Faris N. Abuali,
Roger L. Wainwright,
Dale A. Schoenefeld:
Solving the subset interconnection design problem using genetic algorithms.
SAC 1996: 299-304 |
| 1995 |
|---|
| 6 | | Faris N. Abuali,
Roger L. Wainwright,
Dale A. Schoenefeld:
Determinant Factorization: A New Encoding Scheme for Spanning Trees Applied to the Probabilistic Minimum Spanning Tree Problem.
ICGA 1995: 470-477 |
| 5 | EE | Faris N. Abuali,
Roger L. Wainwright,
Dale A. Schoenefeld:
Determinant factorization and cycle basis: encoding schemes for the representation of spanning trees on incomplete graphs.
SAC 1995: 305-312 |
| 4 | EE | Faris N. Abuali,
Roger L. Wainwright,
Dale A. Schoenefeld:
Solving the three-star tree isomorphism problem using genetic algorithms.
SAC 1995: 337-344 |
| 1994 |
|---|
| 3 | EE | Faris N. Abuali,
Dale A. Schoenefeld,
Roger L. Wainwright:
Terminal Assignment in a Communications Network Using Genetic Algorithms.
ACM Conference on Computer Science 1994: 74-81 |
| 2 | EE | Faris N. Abuali,
Dale A. Schoenefeld,
Roger L. Wainwright:
Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees.
SAC 1994: 242-246 |
| 1993 |
|---|
| 1 | | Faris N. Abuali,
Roger L. Wainwright:
ISA[ k ] Trees: a Class of Binary Search Trees with Minimal or Near Minimal Internal Path Length.
Softw., Pract. Exper. 23(11): 1267-1283 (1993) |
