1228 search results - page 15 / 246 » Continuations, proofs and tests |
IPL
2007
13 years 7 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
CSR
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
This work focuses on the convergence analysis of adaptive distributed beamforming schemes that can be reformulated as local random search algorithms via a random search framework....
TPHOL
1996
IEEE
14 years 1 days ago
1996
IEEE
We will present a Logic of Computable Functions based on the idea of Synthetic Domain Theory such that all functions are automatically continuous. Its implementation in the Lego pr...
SENSYS
2009
ACM
14 years 2 months ago
2009
ACM
Continuous and reliable operation of WSNs is notoriously difficult to guarantee due to hardware degradation and environmental changes. In this paper, we propose and demonstrate a ...