 | Up a level |
Collaboration networkThis graph maps the connections between all the collaborators of {}'s publications listed on this page.
Each link represents a collaboration on the same publication. The thickness of the link represents the number of collaborations.
Use the mouse wheel or scroll gestures to zoom into the graph.
You can click on the nodes and links to highlight them and move the nodes by dragging them.
Hold down the "Ctrl" key or the "⌘" key while clicking on the nodes to open the list of this person's publications.
Aourid, S. M., & Kaminska, B. (1997). Static Test Vector Compaction by the Set Covering Problem. (Technical Report n° 1034). Unavailable
Aourid, S. M., & Kaminska, B. (1996). Minimization of the 0-1 linear-programming problem under linear constraints by using neural networks - synthesis and analysis. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 43(5), 421-425. External link
Aourid, S. M. (1995). Synthèse de réseaux de neurones artificiels pour résoudre des problèmes d'optimisation NP-complets applications en VLSI [Ph.D. thesis, École Polytechnique de Montréal]. Unavailable
Aourid, S. M., & Kaminska, B. (1994, June). Neural networks for the set covering problem: An application to the test vector compaction [Paper]. 1994 IEEE International Conference on Neural Networks, Orlando, FL, USA. External link
