To evaluate the performance of a real valued ge netic algorithm GA exploiting domain knowledge we sys tematically evaluate the e ect of exogenous parameters us ing analysis of variance The GA platform used for this study is Genocop III a real valued co evolutionary algo rithm implementation for numerical optimization We use the protein structure prediction PSP problem as our test domain Nearly ...

In this paper we design a nonadaptive NC checker for permutation group intersec tion sharpening a result from Blum and Kannan This is a consequence of two results First we show that a nontrivial permutation in the intersection of two given permutation groups described by lists of generators can be computed by an NC algo rithm with one round of parallel queries to the Group Intersection problem ...

Many existing rule learning systems are computationally expensive on large noisy datasets In this paper we evaluate the recently proposed rule learning algorithm IREP on a large and diverse collection of benchmark problems We show that while IREP is extremely e cient it frequently gives error rates higher than those of C and C rules We then propose a num ber of modi cations resulting in an algo...

Recently, data abstraction has been studied in thecontext of separation logic, with noticeable practicalsuccesses: the developed logics have enabled cleanproofs of tricky challenging programs, such as subject-observer patterns, and they have become the basis of ef-ficient verification tools for Java (jStar), C (VeriFast)and Hoare Type Theory (Ynot). In this paper, we giv...

Amorphous computing is the study of programming ultra scale computing environments of smart sensors and actuators that communicate locally via wireless broadcast In such environments where individual el ements have limited resources aggregation into groups is useful for specialization fault tolerance and re source allocation This paper presents a new algo rithm called clubs that takes advantage...

The input output automaton model has recently been de ned in LT LT as a tool for modeling concurrent and distributed discrete event systems of the sorts arising in computer science Since its introduction the model has been used for describing and reasoning about several di erent types of systems including network resource allocation algorithms communication algorithms concurrent database system...

We show that all algorithms that search for an extremum of a cost function perform exactly the same when averaged over all possible cost functions In particular if algorithm A outperforms algorithm B on some cost functions then loosely speaking there must exist exactly as many other functions where B outperforms A Starting from this we analyze a number of the other a priori characteristics of t...

We propose an algorithm called query by com mittee in which a committee of students is trained on the same data set The next query is chosen according to the principle of maximal disagreement The algorithm is studied for two toy models the high low game and perceptron learning of another perceptron As the number of queries goes to in nity the committee algo rithm yields asymptotically nite info...

We propose an algorithm for solving the maximumweighted stable set problem on claw-free graphsthat runs in O(n3)−time, drastically improving theprevious best known complexity bound. This algo-rithm is based on a novel decomposition theoremfor claw-free graphs, which is also introduced in thepresent paper. Despite being weaker than the wellknown structure result for claw-...

This article discusses a rule-based fuzzy model for the identi cation of nonlinear MISO (multiple input, single output) systems. The dis cussed method of fuzzy modeling consists of two parts: structure modeling, i.e. determing the num ber of rules and input variables involved respec tively, and parameter optimization, i.e. optimizing the location and form of the curves which describe the fuz...