We present diierent architectures to solve Boolean satissa-bility problems in instance-speciic hardware. A simulation of these ar-chitectures shows that for examples from the DIMACS benchmark suite, high raw speed-ups over software can be achieved. We present a design tool ow and prototype implementation of an instance-speciic satiss-ability solver and discuss experimental results. We measure t...

Evolutionary programming (EP) is one of the major branches of evolutionary computation. It has been applied to many learning and optimisation problems with success in recent years. This paper gives an overview of the latest results on evolutionary programming. In particular , the paper will analyse why the recently proposed fast EP performs better than classical EP for most benchmark functions,...

In ciliates, chromosomal rearrangements occur during the development of the somatic macronuclear genome from the germline micronuclear genome. These rearrangements are extensive in three ciliate classes-Armophorea, Spirotrichea, and Phyllopharyngea-generating a macronucleus with up to 20,000,000 gene-sized chromosomes. Earlier, we have shown that these three classes also share elevated rates of...

Sixty organic and aqueous extracts of eleven plants used for the control of malaria by local communities in Kisii District, Kenya were screened for in vitro anti-plasmodial activity. The plants selection was based on existing ethnobotanical information and interviews with local communities. The extracts were tested against chloroquine sensitive and resistant laboratory adapted strains of Plasmo...

• The strength and consistency of genotypic differences in disease resistance determine the potential for resistance evolution in host populations that rely on vegetative reproduction. Here we surveyed infection intensity of host genotypes across space and time to estimate genotypic and environmental effects on quantitative disease resistance. • Cloned fragments of 12 Euthamia graminifolia geno...

We describe a method for predicting a clas­ sification of an object given classifications of the objects in the training set, assuming that the pairs object/classification are generated by an i.i.d. process fr om a continuous proba­ bility distribution. Our method is a modifica­ tion of Vapnik's support-vector machine; its main novelty is that it gives not only the pre­ diction itself but also ...

The construction of symbolic reachability graphs is a useful technique for reducingg state explosion in High-level Petri nets. Such a reduction is obtained by exploitingg the symmetries of the whole net [1]. In t his paper, we extendd this methodd to deal with partial symmetries. In a first tim e, we introduce an example which shows the interest andd the principles of o ur method. Then we devel...

One of the most important analysis problems of hybrid systems is the reacha-bility problem. State of the art computational tools perform reachability computation for timed automata, multirate automata, and rectangular automata. In this paper, we extend the decidability frontier for classes of linear hybrid systems, which are introduced as hybrid systems with linear vector elds in each discrete ...

This paper emphasizes on design issues to build scalable systems with the upcoming trend of k-ary n-cube cluster-c interconnection. Such organization takes advantage of VLSI integration and advancements in packaging technologies to interconnect multiple processors into a chip or a board in a cost-eeective manner. While the cluster organization helps exploiting locality, the clusters are connect...

We investigate the complexity and approximability of a basic optimization problem in the second level of the Polynomial Hierarchy, that of nding shortest implicants. We show that the DNF variant of this problem is complete for a complexity class in the second level of the hierarchy utilizing log 2 n-limited nondeterminism. We obtain inap-proximability results for the DNF and formula variants of...