We propose a technology mapping algorithm that takes existing structural technology-mapping algorithms based on dynamic programming [1,3,4] and extends them to retime pipelined cir...
Joel Grodstein, Eric Lehman, Heather Harkness, Her...
We are developing tools to support a conversational metaphor for requirements definition and analysis. Our conversational model consists of three components: (1) a hypertextual re...
While most previous work in planning manipulation tasks relies on the assumption of quasi-static conditions, there can be situations where the quasi-static assumption may not hold...
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...