If all NP complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) then P @@@@ NP and if all PTAPE complete sets are p-isomorphic then P @@@@ PTAPE. We show that allâ€¦ (More)

The convergence of back-propagation learning is analyzed so as to explain common phenomenon observed by practitioners. Many undesirable behaviors of backprop can be avoided with tricks that areâ€¦ (More)

We investigated a real-valued Negative Selection Algorithm (NSA) for fault detection in man-in-the-loop aircraft operation. The detection algorithm uses body-axes angular rate sensory data exhibitingâ€¦ (More)

The goal of this roadmap paper is to summarize the stateof-the-art and identify research challenges when developing, deploying and managing self-adaptive software systems. Instead of dealing with aâ€¦ (More)

24th Annual Symposium on Foundations of Computerâ€¦

1983

In this paper we define a generalized, two-parameter, Kolmogorov complexity of finite strings which measures how much and how fast a string can be compressed and we show that this string complexityâ€¦ (More)

The work reported in this note was motivated by the desire to understand better what makes the recognition of languages in NP hard, provided P*NP. It is generally conjectured that P * NP [5] andâ€¦ (More)

The purposes of this paper is to give simple new proofs of some interesting recent results about the relative succinctness of different representations of regular, deterministic and unambiguousâ€¦ (More)