Faris N. Abuali

According to our database, Faris N. Abuali authored at least 8 papers between 1991 and 1996.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

1996

Solving the subset interconnection design problem using genetic algorithms.

Faris N. Abuali, Roger L. Wainwright, Dale A. Schoenefeld

Proceedings of the 1996 ACM Symposium on Applied Computing, 1996

1995

Solving the three-star tree isomorphism problem using genetic algorithms.

Faris N. Abuali, Roger L. Wainwright, Dale A. Schoenefeld

Proceedings of the 1995 ACM symposium on applied computing, 1995

Determinant factorization and cycle basis: encoding schemes for the representation of spanning trees on incomplete graphs.

Faris N. Abuali, Roger L. Wainwright, Dale A. Schoenefeld

Proceedings of the 1995 ACM symposium on applied computing, 1995

Determinant Factorization: A New Encoding Scheme for Spanning Trees Applied to the Probabilistic Minimum Spanning Tree Problem.

Faris N. Abuali, Roger L. Wainwright, Dale A. Schoenefeld

Proceedings of the 6th International Conference on Genetic Algorithms, 1995

1994

Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees.

Faris N. Abuali, Dale A. Schoenefeld, Roger L. Wainwright

Proceedings of the 1994 ACM Symposium on Applied Computing, 1994

Terminal Assignment in a Communications Network Using Genetic Algorithms.

Faris N. Abuali, Dale A. Schoenefeld, Roger L. Wainwright

Proceedings of the ACM 22rd Annual Computer Science Conference on Scaling up: Meeting the Challenge of Complexity in Real-World Computing Applications, 1994

1993

ISA[ <i> k </i> ] Trees: a Class of Binary Search Trees with Minimal or Near Minimal Internal Path Length.

Faris N. Abuali, Roger L. Wainwright

Softw. Pract. Exp., 1993

1991

Fringe analysis of binary search trees with miniml internal path length.

Faris N. Abuali, Roger L. Wainwright

Proceedings of the 19th annual conference on Computer Science, 1991