2490 search results - page 179 / 498 » Complexity of Contextual Reasoning |
132
Voted
LOGCOM
2006
15 years 4 months ago
2006
For every Kripke complete modal logic L we define its hybrid companion LH . For a reasonable class of logics, we present a satisfiability-preserving translation from LH to L. We p...
147
click to vote
IJON
2002
15 years 4 months ago
2002
For a network of spiking neurons that encodes information in the timing of individual spike times, we derive a supervised learning rule, SpikeProp, akin to traditional errorbackpr...
115
click to vote
ICIP
2003
IEEE
16 years 6 months ago
2003
IEEE
The problem of finding the optimal set of quantized coefficients for a frame-based encoded signal is known to be of very high complexity. This paper presents an efficient method o...
140
click to vote
TCOM
2010
14 years 11 months ago
2010
In this paper, we propose a new implementation of the Extended Min-Sum (EMS) decoder for non-binary LDPC codes. A particularity of the new algorithm is that it takes into accounts...
159
click to vote
CADE
2005
Springer
16 years 5 months ago
2005
Springer
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...