5084 search results - page 141 / 1017 » Proving Possibility Properties |
150
Voted
LOGCOM
2000
15 years 5 months ago
2000
We introduce the concept of reflection principle as a knowledge representation paradigm in a computational logic setting. Reflection principles are expressed as certain kinds of l...
159
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
193
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We propose a new approach to value function approximation which combines linear temporal difference reinforcement learning with subspace identification. In practical applications...
193
click to vote
RSA
2010
15 years 4 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
158
click to vote
GLOBECOM
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract-- This work deals with devising a secure, powerefficient, beam-steerable and on-chip transmission system for wireless sensor networks. A passively controllable smart (PCS)...