A simple procedure to tighten the Lagrangian bounds is proposed. The approach is interpreted in two ways. First, it can be seen as a reformulation of the original problem aimed to split the resulting Lagrangian problem into two subproblems. Second, it can be considered as a search for a tighter estimation of the penalty term arising in the Lagrangian problem. The new bounds are illustrated by a...

Given two point sets S and T , we study the many-to-many matching with demands problem (MMD problem) which is a generalization of the many-to-many matching problem (MM problem). In an MMD, each point of one set must be matched to a given number of the points of the other set (each point has a demand). In this paper we consider a special case of MMD problem, the one-dimensional MMD (OMMD), where...

This paper describes ThreadMon, a monitoring tool for improving the performance of multithreaded programs, and how we have used it to examine various aspects of the many-to-many (or two-level) threads implementation model. We run unmodified binary subject code, insert software probes to collect data, and analyze and present the results in real time on another machine. We show that the behavior ...

RASTA (Rhetorical Structure Theory Analyzer), a system for automatic discourse analysis, reliably, identifies rhetorical relations present m written discourse by examining information available in syntactic and logical form analyses. Since there is a many-to-many relationship between rhetorical relations and elements of linguistic form, RASTA identifies relations by the convergence of a number ...