Search

We introduce a new class of containment graphs called circular- arc containment graphs. A graph is called a circular-arc containment graph if there exists a family of arcs on a circle, such that each vertex corresponds to ...

The application of simulated annealing to the global optimization of a function on a compact subset of R^d is discussed. For the Langevin algorithm the class of convergent schedules depends on some a priori knowledge about ...

The ability to accurately calculate the temperature profile of a printed wiring board (PWB) is necessary in determining the reliability of the PWB. Calculating temperatures of electronic components on PWBs requires that ...

The relative disturbance gain (RDG) is a recently introduced index that can be used to assess control loop operability. It is applied to the problem of controlling composition at both ends of heat integrated towers. Using ...

When solving inequality constrained optimization problems via Sequential Quadratic Programming (SQP), it is potentially advantageous to generate iterates that all satisfy the constraints: all quadratic programs encountered ...

The asymptotic stability of a general linear time-invariant multiparameter singular perturbation problem is studied with no a priori assumptions on the relative magnitudes of the small parameters. Thus the results apply, ...

This paper considers the output process of a system of K DOT /M/I queues in parallel with Bernoulli routing of jobs upon arrival. It is shown that the output process is stochastically increasing as the routing probabilities ...

Neural computing is one of the fastest growing branches of artificial intelligence. Neural Nets, endowed with inherent parallelism hold great promise owing to their ability to capture highly nonlinear relationships. This ...

We consider the channel routing problem of a set of two-terminal nets in the knockknee model. The known strategy to handle this problem seems to beinherently sequential. We develop a new approach to route all the nets ...