We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
— Mechanisms utilizing rigid links and relatively small flexural joints are very suitable for fabrication at the meso scale. The Micromechanical Flying Insect (MFI) project at U...
Studies of Aspect-Oriented Programming (AOP) usually focus on a language in which a specific aspect extension is integrated with a base language. Languages specified in this man...
We identify a class of mechanical systems for which a globally exponentially stable reduced order observer can be designed. The class is characterized by (the solvability of) a set...
Aneesh Venkatraman, Romeo Ortega, Ioannis Sarras, ...