Andrew V. Goldberg, Jeffrey D. Oldham, Serge Plotkin, Cliff Stein
Abstract. The minimum-cost multicommodity flow problem involves simultaneously shipping multiple commodities through a single network so that the total flow obeys arc capacity constraints and has...
an Interactive Parallel Programming Tool y (2007)
Nathaniel Mcintosh, Kathryn S. Mckinley, Jeffery D. Oldham, Michael Paleczny, Mary W. Hall, Mary W. Hall, ...
The ParaScope Editor is an interactive parallel programming tool that assists knowledgeable users in developing scientific Fortran programs. It displays the results of sophisticated program analyses,...
Andrew Goldberg, Jeffrey D. Oldham, Serge Plotkin, Cliff Stein
The minimum-cost multicommodity flow problem involves simultaneously shipping multiple commodities through a single network so that the total flow obeys arc capacity constraints and has minimum cost....
Craig Br, Brent Lew, Jason Meridth, Sara Meyer, Scott Schaefer, Peter Shaffer, ...
Determining a sustainable withdrawal rate is an important factor to consider in retirement investment planning. An equally important problem is determining an accumulation rate yielding an investment...
1.1 Course Goals and Objectives (2000)
Jeffrey D. Oldham, Instructor Jeffrey, D. Oldham
This course is the second course for computer science majors, following the guidelines established by the Association for Computing Machinery. This course also partially satisfies the requirements...
1 Caveat Reader! C++ References (2000)
I wrote this notes to prepare myself for lecture. The topic of returning references from functions is not well documented, even in the C++ language definition so I have used my experience to guess...
1 Caveat Reader! I wrote this notes to prepare myself for lecture. The topic of returning references from functions is not well documented, even in the C++ language definition so I have used my...
1 Executive Summary CS1321 Homework 9 Hash Function (2000)
In CS1321-2 today, Travis Pinney queried how to check that one’s hash function implementation is correct. While trying to answer his question, I discovered the hashing scheme did not work as...
1 Introduction God’s Calling (2000)
We will examine case studies using primary historical resources, including the Bible, to explore how God
Names of God and Exodus 3:16 (2000)
Starting with Exodus 3:16, we will explore the verse’s translation and its context to learn about different names for God. (Start by listing as many different names for God as possible. Possibly...
Combinatorial approximation algorithms for generalized flow problems (1999)
Generalized network flow problems generalize normal network flow problems by specifying a flow multiplier (a) for each arc a. For every unit of flow entering the arc, (a) units of flow exit. Flow...
Jeffrey D. Oldham, Instructor Jeffrey, D. Oldham
This course explores the design and implementation of operating systems, i.e., the software that eases use of a computer’s hardware resources. Among the topics we will cover are the history of...
Policies for managing TCP connections under persistent HTTP (1999)
Edith Cohen, Haim Kaplan, Jeffrey D. Oldham
Hyper Text Transfer Protocol (HTTP) traffic dominates Internet traffic. The exchange of HTTP messages is implemented using the connection-oriented TCP. HTTP/1.0 establishes a new TCP connection for...
Parallel Algorithms for the All-Sources Generalized Shortest Paths Problem (1999)
Jeffrey D. Oldham, Vaughan Pratt
Generalized network ow problems generalize ordinary network ow problems by specifying a ow multiplier (a) for each arc a. For every unit of ow entering the arc, (a) units of ow exit. We present...
Parallel Algorithms for the All-Sources Generalized Shortest Paths Problem (1999)
Jeffrey D. Oldham, Vaughan Pratt
Generalized network flow problems generalize ordinary network flow problems by specifying a flow multiplier for each arc. For every unit of flow entering the arc, units of flow exit. We present...
Combinatorial approximation algorithms for generalized flow problems (1999)
Generalized network flow problems generalize normal network flow problems by specifying a flow multiplier for each arc. For every unit of flow entering the arc, units of flow exit. Flow multipliers...
Managing TCP Connections under Persistent HTTP (1999)
Edith Cohen, Haim Kaplan, Jeffrey D. Oldham
Hyper Text Transfer Protocol (HTTP) traffic dominates Internet traffic. The exchange of HTTP messages is implemented using the connection-oriented TCP.
VSIPL++: Parallel Performance (1998)
Mitchell, Mark, Oldham, Jeffrey D.
VSIPL++(exp 1) is the object-oriented "next-generation" version of the Vector Signal and Image Processing Library (VSIPL). Like VISPL, VSIPL++ specifies an Application Programming Interface (API) for...
Dedicating Our Church’s Sanctuary (1998)
1998. To celebrate this, I, as chairperson of the Administrative Council, will read this devotional at the beginning of the December meeting.) At our October Administrative Council, we talked about...
Episcopal Church North and the Methodist Episcopal Church South merged to (1998)
this year of 1998. To celebrate this, I, as chairperson of the Administrative Council, will read this devotional at the beginning of the April meeting.) Business sent me to Montreal, but...
The “Prehistory ” of First UMC (1998)
this year of 1998. To celebrate this, I, as chairperson of the Administrative Council, will read this devotional at the beginning of a meeting.) 1
Andrew Goldberg, Jeffrey D. Oldham, Serge Plotkin, Cliff Stein
The minimum-cost multicommodity flow problem involves simultaneously shipping multiple commodities through a single network so that the total flow obeys arc capacity constraints and has minimum cost....
UsingMCMCF to Solve Multicommodity Flow Problems (1998)
The program MCMCF approximately solves the minimum-cost multicommodity flow problems on
1 Do We See God? Seeing, Seeking, Following (1997)
Five hundred five years ago today, in 1492, Christopher Columbus sailed west from Spain to reach the East. For centuries, the spice trade had gone overland from India. In hopes of finding a new route...
Experiences Using the ParaScope Editor: an Interactive Parallel Programming Tool (1993)
Nathaniel Mcintosh, Kathryn S. Mckinley, Jeffery D. Oldham, Michael Paleczny, Mary Hall, Mary W. Hall, ...
The ParaScope Editor is an interactive parallel programming tool that assists knowledgeable users in developing scientific Fortran programs. It displays the results of sophisticated program analyses,...
Experiences Using the ParaScope Editor: an Interactive Parallel Programming Tool (1993)
Mary W. Hall, Timothy J. Harvey, Ken Kennedy, Nathaniel McIntosh, Kathryn S. McKinley, Jeffrey D. Oldham, ...
The ParaScope Editor is an interactive parallel programming tool that assists knowledgeable users in developing scientific Fortran programs. It displays the results of sophisticated program analyses,...
Combinatorial Approximation Algorithms for Generalized Flow Problems
Generalized network flow problems generalize normal network flow problems by specifying a flow multiplier (a) for each arc a. For every unit of flow entering the arc, (a) units of flow exit. Flow...