Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

M. Scott

dblp:40/6900 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithms and data structures · 67% Mathematical optimization · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithms and data structures › computer arithmetic
arbitrary-precision arithmetic
0.011989
Fast Rounding in Multiprecision Floating-Slash Arithmetic · IEEE Trans. Computers 1989
Algorithms and data structures
numerical algorithms
0.011989
Fast Rounding in Multiprecision Floating-Slash Arithmetic · IEEE Trans. Computers 1989
Mathematical optimization › linear programming relaxation
rounding
0.011989
Fast Rounding in Multiprecision Floating-Slash Arithmetic · IEEE Trans. Computers 1989
YearPublicationVenuePosition
2000 A framework for the performance evaluation of integrated networks
abstract
Rapid convergence of all modes of communications enabling universal, ubiquitous access is opening up new areas of research. This is especially true of the performance evaluation domain for these heterogeneous ("integrated") networks. Typical scenarios currently envisioned for heterogeneous networks assume packet core networks accessed via a wide variety of techniques such as traditional wire-line, wireless, cable, etc., connected to access devices such as traditional wire-line phones, mobile phones, cable modems, etc. At Nortel Networks, two projects are underway to characterize the performance of integrated networks. The first is a live-air trial of a prototype network using CDMA for wireless access to an IP core network. The second is the development of a simulation model to be used to predict the behavior of large-scale integrated networks. This paper is an attempt at organizing the lessons learned from these twin efforts into a logical sequence of steps for evaluating network performance. Presented here is the resulting generic framework for the performance evaluation of integrated networks.
L. Patterson, M. Scott, B. Chotiner, M. Bautista, K. Grigsby, S. Aguirre, A. Armand
WCNC3
1989 Fast Rounding in Multiprecision Floating-Slash Arithmetic
abstract
A computational algorithm is described which quickly rounds large fractions into a fixed-length multiprecision floating-slash representation, using single-precision operations where possible. An easily calculated criterion for terminating the rounding process is given.>
M. Scott
IEEE Trans. Computers1