RAPPORTS TECHNIQUES D'INFORMATIQUE (1996)
École d'Ingénierie et de Technologie de l'InformationUniversité d'Ottawa
Ottawa, Ontario K1N 6N5 CANADA
http://www.site.uottawa.ca/fra/ecole/publications
| TR-96-01 | Experimental Validation of a Semi-Automatic Text Analyser. | Ken Barker, Sylvain Delisle | March 1996. |
| TR-96-02 | On the Dynamic Initialization of Parallel Computers. | S. Olariu, I. Stojmenovic | March 1996. |
| TR-96-03 | WordNet-based Word Sense Disambiguation That Works for Short Texts. | S. Szpakowicz, S. Matwin, K. Barker | April 1996. |
| TR-96-04 | Preliminary Validation of Text Summarization Algorithm. | K. Barker, T. Copeck, J.-F. Delannoy, S. Matwin, S. Szpakowicz | July 1996. |
| TR-96-05 | Preventing Overshoot of Splines with Application to Reinforcement Learning. | Chris. G. Drummond | June 1996. |
| TR-96-06 | Some P(EC)mE Methods for the Parallell Solution of ODE's. | Louis G. Birta, Liming Yang | June 1996. |
| TR-96-07 | A New Bound For the 2- Matching Problem. | Sylvia Boyd, Robert Carr | June 1996. |
| TR-96-08 | The Assessment of Semantic Cases Using English Positional, Prepositional and Adverbial Case Markers. | Ken Barker | July 1996. |
| TR-96-09 | An Algorithm for Submodule Construction. | Esfanfiar Haghverdi and Hasan Ural | August 1996. |
| TR-96-10 | Systematic Construction of a Versatile Case System. | Ken Barker, Terry Copeck, Sylvain Delisle, Stan Szpakowicz | September 1996. |
| TR-96-11 | An improvement om partial-order model-checking with ample sets. | Hans van der Schoot and Hasan Ural | September 1996. |
| TR-96-12 | Finding Low Cost TSP and 2-matching Solutions Using Certain Half-Integer Subtour Vertices. | Sylvia Boyd and Robert Carr | September 1996. |
| TR-96-13 | A uniform approach to tackle state explosion in verifying progress properties for networks of CFSMs. | Hans van der Schoot and Hasan Ural | November 1996. |
| TR-96-14 | A Special Case of the Network Location Problem. | Sylvia Boyd and Karina Marcus | December 1996. |