We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
Abstract— Optimal rate allocation in a networked control system with highly limited communication resources is instrumental to achieve satisfactory overall performance. In this p...
Lei Bao, Mikael Skoglund, Carlo Fischione, Karl He...
Abstract-- This paper presents a fundamental result on buffer sizing. Given an interconnection wire with n buffers evenly spaced along the wire, we would like to size all buffers s...
DNA-protein alignment algorithms can be used to discover coding sequences in a genomic sequence, if the corresponding protein derivatives are known. They can also be used to ident...
Pang Ko, Mahesh Narayanan, Anantharaman Kalyanaram...
In this paper, we describe how a genetic algorithm approach added to a simulated annealing (SA) process offers a better alternative to find the mean variance frontier in the portf...
Miguel A. Gomez, Carmen X. Flores, Maria A. Osorio