#### Filter Results:

- Full text PDF available (1)

#### Publication Year

1965

2016

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

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Charles R. Baugh, Bruce A. Wooley
- IEEE Trans. Computers
- 1973

- Saburo Muroga, Teiichi Tsuboi, Charles R. Baugh
- IEEE Trans. Computers
- 1970

- Charles R. Baugh
- IEEE Trans. Computers
- 1971

Upper and lower bounds are derived for the number of pseudothreshold functions of n variables. (Pseudothershold logic is a generalization of threshold logic.) It is shown that a lower bound on the number of pseudothreshold functions P(n) of exactly n variables realized by zero-free structures is 2{(2n-(1/2) 4an-I +n The number of pseudothreshold functions… (More)

- Charles R. Baugh, C. S. Chandersekaran, Richard S. Swee, Saburo Muroga
- IEEE Trans. Computers
- 1972

- Charles R. Baugh
- IEEE Trans. Computers
- 1972

- Toshihide Ibaraki, Tso-Kai Liu, Charles R. Baugh, Saburo Muroga
- International Journal of Computer & Information…
- 1972

This paper describes some techniques to improve the speed of the implicit enumeration method for solving zero-one integer programming problems. Among these techniques, the most powerful is the one of using a column vector which works as a tag for each inequality, indicating whether or not the inequality should be checked for the current partial solution. A… (More)

- A Aggoun, M K Ibrahim, +7 authors A Nix
- 2016

In this paper the delayed least-mean-square (DLMS) algorithm is proposed for training a transversal filter-based decision feedback equalizer (DFE). Delays in the filter coefficient update process are used to pipeline the DFE, thereby increasing the throughput rate, for a given speed of hardware. The filter structures selected for the feedforward and… (More)

- Charles R. Baugh, Toshihide Ibaraki, Saburo Muroga
- Operations Research
- 1971

- C. R. Baugh
- ACM '65
- 1965

IN FORTRAN PROGRAMMING of extensive storage problems the programmer has to devise elaborate schemes to make use of available space. The programmer also has to define the extent of the storage before execution, even when the sizes of the various data blocks are unknown. These requirements place severe restrictions on the efficient use of the size of the… (More)

- Naofumi Takagi, Haruyuki Tago, Charles R. Baugh, Saburo Muroga
- The VLSI Handbook
- 1999