We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle"...
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
The extensive research and development of micromechanical resonators is trying to allow the use of these devices for highly sensitive applications. Microcantilevers are some of th...
Margarita Narducci, Eduard Figueras, Isabel Gracia...
Abstract. Ariola and Felleisen's call-by-need -calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substituti...
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many r...