52 search results - page 3 / 11 » Characterizing Provability in |
MLQ
1998
13 years 9 months ago
1998
This paper presents a new method – which does not rely on the cut-elimination theorem – for characterizing the provably total functions of certain intuitionistic subsystems of ...
ALGOSENSORS
2007
Springer
14 years 4 months ago
2007
Springer
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
EUROCRYPT
2004
Springer
14 years 3 months ago
2004
Springer
For the last two decades the notion and implementations of proxy signatures have been used to allow transfer of digital signing power within some context (in order to enable flexi...
ICALP
2004
Springer
14 years 3 months ago
2004
Springer
We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...
CDC
2008
IEEE
14 years 4 months ago
2008
IEEE
— This paper examines stability properties of distance-based formations. These are formations encoded by inter-agent relative distances. A negative gradient control law is propos...