1716 search results - page 113 / 344 » Proving Conditional Termination |
78
Voted
ICRA
2003
IEEE
15 years 6 months ago
2003
IEEE
—We prove a new necessary and sufficient condition for 2D three-finger equilibrium grasps and implement a geometrical algorithm for computing force-closure grasps of polygonal ob...
80
Voted
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
— This paper presents a novel distributed estimation algorithm based on the concept of moving horizon estimation. Under weak observability conditions we prove convergence of the ...
102
Voted
STOC
1994
ACM
15 years 4 months ago
1994
ACM
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...
87
Voted
ECCC
2006
15 years 24 days ago
2006
In this paper we ask the question whether the extended Frege proof system EF satisfies a weak version of the deduction theorem. We prove that if this is the case, then complete dis...
EJC
2006
15 years 24 days ago
2006
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been u...