|
Search the dblp DataBase
Faris N. Abuali:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Faris N. Abuali, Dale A. Schoenefeld, Roger L. Wainwright
Terminal Assignment in a Communications Network Using Genetic Algorithms. [Citation Graph (0, 0)][DBLP] ACM Conference on Computer Science, 1994, pp:74-81 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] ICGA, 1995, pp:470-477 [Conf]
- Faris N. Abuali, Dale A. Schoenefeld, Roger L. Wainwright
Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees. [Citation Graph (0, 0)][DBLP] SAC, 1994, pp:242-246 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] SAC, 1995, pp:305-312 [Conf]
- Faris N. Abuali, Roger L. Wainwright, Dale A. Schoenefeld
Solving the three-star tree isomorphism problem using genetic algorithms. [Citation Graph (0, 0)][DBLP] SAC, 1995, pp:337-344 [Conf]
- Faris N. Abuali, Roger L. Wainwright, Dale A. Schoenefeld
Solving the subset interconnection design problem using genetic algorithms. [Citation Graph (0, 0)][DBLP] SAC, 1996, pp:299-304 [Conf]
- Faris N. Abuali, Roger L. Wainwright
ISA[ k ] Trees: a Class of Binary Search Trees with Minimal or Near Minimal Internal Path Length. [Citation Graph (0, 0)][DBLP] Softw., Pract. Exper., 1993, v:23, n:11, pp:1267-1283 [Journal]
Search in 0.001secs, Finished in 0.002secs
|