Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
: This paper describes six new architecture-altering operations that provide a way to dynamically determine the architecture of a multipart program during a run of genetic programm...
We present a tool deciding a fragment of set theory. It is designed to be easily accessible via the internet and intuitively usable by anyone who is working with sets to describe a...
This note contains two results on the distribution of k-crossings and k-nestings in graphs. On the positive side, we exhibit a class of graphs for which there are as many k-noncro...
: In this paper, we intend to study the synthesis of the multibeam arrays. The synthesis implementation’s method for this type of arrays permits to approach the appropriated radi...