1552 search results - page 101 / 311 » On the Complexity of Constant Propagation |
157
click to vote
LOGCOM
2010
15 years 4 months ago
2010
The logic of proofs (LP) was proposed as Gödel’s missed link between Intuitionistic and S4-proofs, but so far the tableau-based methods proposed for LPhave not explored this cl...
198
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we propose a novel blind equalizer which can deal with high-order modulated QAM (quadrature amplitude modulation) signals. This new scheme is based on the signal sel...
176
click to vote
INFORMATICALT
2010
15 years 3 months ago
2010
In this paper we propose facilitating ontology development by constant evaluation of steps in the process of ontology development. Existing methodologies for ontology development a...
192
click to vote
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
194
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...