Studies of trilled vocalizations provide a premiere illustration of how performance constraints shape the evolution of mating displays. In trill production, vocal tract mechanics impose a trade-off between syllable repetition rate and frequency bandwidth, with the trade-off most pronounced at higher values of both parameters. Available evidence suggests that trills that simultaneously maximize ...

Real-time multiprocessor systems are now commonplace. Designs range from single-chip architectures, with a modest number of processors, to large-scale signal-processing systems, such as synthetic-aperture radar systems. For uniprocessor systems, the problem of ensuring that deadline constraints are met has been widely studied: effective scheduling algorithms that take into account the many comp...

This thesis studies the problem of balancing power and performance in mobile computers, specifically, trading off power for performance by CPU speed-setting. The traditional approach to power-performance trade-offs assumes that batteries and memory bandwidth are ideal and focuses on lowering the energy per operation. This research, however, shows that non-ideal battery and performance behavior ...

We give a simple heuristic sieving algorithm for the m-dimensional exact shortest vector problem (SVP) which runs in time 2. Unlike previous time-memory trade-offs, we do not increase the memory, which stays at its bare minimum 2. To achieve this complexity, we borrow a recent tool from coding theory, known as nearest neighbor search for binary code words. We simplify its analysis, and show tha...

We are given a read-only memory for input and a write-only stream for output. For a positive integer parameter s, an s-workspace algorithm is an algorithm using only O(s) words of workspace in addition to the memory for input. In this paper, we present an O(n/s)-time s-workspace algorithm for subdividing a simple polygon into O(min{n/s, s}) subpolygons of complexity O(max{n/s, s}). As applicati...

In this paper we establish c-bit semi-external graph algorithms, – i.e., algorithms which need only a constant number c of bits per vertex in the internal memory. In this setting, we obtain new trade-offs between time and space for I/O efficient LTL model checking. First, we design a c-bit semi-external algorithm for depth-first search. To achieve a low internal memory consumption, we construct...

This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers’ satisfaction have been taken into account. Meanwhile, the introduced model prepares a...