5 search results - page 1 / 1 » Rigid Reachability |
ASIAN
1998
Springer
14 years 3 months ago
1998
Springer
We show that rigid reachability, the non-symmetric form of rigid E-unification, is undecidable already in the case of a single constraint. From this we infer the undecidability of ...
ICRA
2002
IEEE
14 years 4 months ago
2002
IEEE
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
PLDI
2009
ACM
14 years 6 months ago
2009
ACM
Program errors are a source of information leaks. Tracking these leaks is hard because error propagation breaks out of program structure. Programming languages often feature excep...
CANS
2007
Springer
14 years 5 months ago
2007
Springer
We consider a key distribution scheme for securing node-to-node communication in sensor networks. While most schemes in use are based on random predistribution, we consider a syste...
JCDCG
2004
Springer
14 years 4 months ago
2004
Springer
We prove that all single-vertex origami shapes are reachable from the open flat state via simple, non-crossing motions. We also consider conical paper, where the total sum of the ...