#### Filter Results:

- Full text PDF available (2)

#### Publication Year

1989

2006

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- K. B. Lakshmanan, Krishnaiyan Thulasiraman, M. A. Comeau
- IEEE Trans. Software Eng.
- 1989

We Present a parallel algorithm for solving the dual transshipment problem [ l I. The traditional dual simplex method does not offer much scope for parallelization, because it moves from one basic feasible solution to another, performing one pivot operation at a time. We present a new method called Mod@ed Network Dual Simpler method which uses concurrent… (More)

- M A Comeau
- 2006

INTRODUCTION T HE INCREASING DEMAND for digital data in computerized geographic information systems has led to the introduction of systems for automatic data capture. Commonly known as raster scanning systems, these systems make use of optical scanners as the primary mode of input. Instead of manually digitizing the data sources, the original map document… (More)

- Krishnaiyan Thulasiraman, Prasad R. Chalasani, Parimala Thulasiraman, M. A. Comeau
- VLSI Design
- 1993

We present U uniJied approuch to the layout compaction und wire balancingproblem. We show that the layout compaction problem can be solved by an algorithm which also solves the primal-dual initialization problem. We formulate the wire balancing problem as a transshipment problem and show that the results of the compaction problem can also used to initialize… (More)

Many classical results in graph theory are equivalent to the maximum-flow minimum-cut theorem of network-flow theory [l]. These results include Tutte’s characterization of maximum matchings in general graphs, Hall’s theorem on bipartite matching, and Menger’s theorem on connectivity. Equivalence among these problems is established by constructing… (More)

- M.H. Ali, M.A. Comeau
- Conference Proceeding IEEE Pacific Rim Conference…
- 1989

An ISDN user access strategy for wideband and narrowband traffic is studied. Wideband traffic is assumed to be blocked, while narrowband traffic is allowed to queue up. Each user may require a random number of bandwidth units (slots). The exact blocking probability for the wideband users is given, while an approximate solution is given for the message delay… (More)

- ‹
- 1
- ›