|
|
|
|
|
|
|
|
|
|
|
|
ALGORITHMS AND NUMERICAL METHODS
|
| |
|
|
|
|
Algorithms and Numerical Methods are one of the most critical fields to study in order to develop suitable solutions in many problem domains across science and engineering. In the computing arena, a pertinent focus for algorithms and numerical methods is networked computation, especially for internet-based activities. Study of algorithms and numerical methods can yield vital insights to the achieving of efficiency and reliability in the networked computation.
FACULTY
 Dr. Phil G. Richards
Dr. Peter Slater
Dr. Huaming Zhang
PROJECTS
|
|
 Central Subsets in Networks |
|
| |
For such examples as computer networks with n processors, facilities with n designated spaces, and city planning with n areas, one frequently must select some subset S of k of these objects which are most centrally located with respect to the set R of n-k remaining objects. The criteria for measuring what is most central include minimizing the maximum, or the average, distance from a point in R to its nearest point in S, or, alternatively, minimizing the average distance from a point in R to a point in S. Various computational and theoretical aspects of these "facility location" problems are being investigated. |
|
| Colored Problems for Graphs |
|
| |
For a graph G = (V,E) in which vertices in V represent tasks to be scheduled, an edge {u,v} in E might be used to indicate that tasks u and v can not be executed simultaneously. An independent set S in V, a set for which no two vertices are adjacent, then represents a set of tasks that can be executed in parallel. The recently introduced "colored independence" scheduling problems that are being studied incorporate further constraints that certain sets of tasks might be designated as having to be executed concurrently.
|
|
|
|
|
|
| |
|
|
|
|
