This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results- 1Augmented Data Manipulator networks
- 1Cross-address space IPC
- 1Databases
- 1Dynamic Injury Data Project
- 1Genetic Algorithms
- 1Injury surveillance
-
1997
Technical report TR97-04. Genetic algorithms (GAs) are probabilistic search algorithms that are loosely based on biological evolution. Analyzing genetic algorithms has proven difficult, for a variety of reasons, but a landscape paradigm that rigorously models the search of GAs has become...
-
An O(N^1.695) Permutation Routing Algorithm on Augmented Data Manipulators
1997
Elmallah, Ehab, Lam, Chin-Hung
Technical report TR97-07. This paper shows an O(N^1.695) time algorithm for routing any arbitrary admissible permutation on Augmented Data Manipulator networks. The devised algorithm appears to be the first known polynomial time algorithm for solving the above problem. | TRID-ID TR97-07
-
1997
Technical report TR97-06. Injury is one of the most under-recognized public health problems. Reduction of injury is more likely to occur if data are available on causative factors, circumstances and populations at risk. This requires timely collection of data, their organization to enable...
-
1997
Technical report TR97-03. One of the key issues for query processing in distributed open environments is the query scheduling problem. Given a user query, after we know that there are n sources that are relevant to the answer of this query, the first issue we need to address is how...
-
1997
Technical report TR97-08. We present a new facility for cross-address space IPC that exploits queues in memory shared between the client and server address space. The facility employs only widely available operating system mechanisms, and is hence easily portable to different commercial...
-
1997
Technical report TR97-05. This paper describes the inner workings of Keyano, a competitive Othello program that has achieved many top-three finishes in tournament play over the last five years. The unique features of Keyano's midgame search routine, evaluation function and opening book are...
-
1997
Ozsu, M. Tamer, Li, John, Szafron, Duane
Technical report TR97-01. Declarative query languages are an important feature of database management systems and have played an important role in their success. As database management technology enters the multimedia information system domain, the availability of query languages for multimedia...
-
1997
Technical report TR97-02. It is shown that the popular puzzle Sokoban can be used to emulate a linear bounded automata (finite tape Turing Machine (TM)). In particular, a construction is given that has a solution if and only if the corresponding Turing Machine on its input halts in the accept...