Search
Now showing items 101-104 of 104
Neural Voting Machines
(2004-12-31)
 Winner-take-all networks typically pick as winners that alternative with the largest excitatory input. This choice is far from optimal when there is uncertainty in the strength of the inputs, and when information is ...
Machine-Checkable Correctness Proofs forIntra-procedural Dataflow Analyses
(2004-12-16)
This technical report describes our experience using the interactive theorem proverAthena for proving the correctness of abstract interpretation-based dataflow analyses.For each analysis, our methodology requires the ...
Programming an Amorphous Computational Medium
(2004-09)
Amorphous computing considers the problem of controllingmillions of spatially distributed unreliable devices which communicateonly with nearby neighbors. To program such a system, we need a highleveldescription language ...
Example-Based Control of Human Motion
(2004-07-01)
In human motion control applications, the mapping between a control specification and an appropriate target motion often defies an explicit encoding. We present a method that allows such a mapping to be defined by example, ...