1058 search results - page 40 / 212 » It's Doomed; We Can Prove It |
ASPLOS
2012
ACM
12 years 5 months ago
2012
ACM
Disciplined approximate programming lets programmers declare which parts of a program can be computed approximately and consequently at a lower energy cost. The compiler proves st...
AR
2007
13 years 10 months ago
2007
Abstract— Robot imitation is a useful and promising alternative to robot programming. Robot imitation involves two crucial issues. The first is how a robot can imitate a human w...
FOSSACS
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Synthesis is the automatic construction of a system from its specification. In the classical synthesis algorithms it is always assumed the system is “constructed from ...
ENTCS
2000
13 years 9 months ago
2000
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...
COCOON
2006
Springer
14 years 1 months ago
2006
Springer
We consider the problems of straightening polygonal trees and convexifying polygons by continuous motions such that rigid edges can rotate around vertex joints and no edge crossing...