18090 search results - page 280 / 3618 » Computing by Only Observing |
153
click to vote
CATS
2007
15 years 8 months ago
2007
A model for the problem of predicting the outputs of a process, based only on knowledge of previous outputs, is proposed in terms of a decision problem. The strength of this parti...
162
click to vote
JAIR
2008
15 years 6 months ago
2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
174
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...
163
click to vote
JPDC
2006
15 years 6 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
158
click to vote
IGPL
2007
15 years 6 months ago
2007
This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only bra...