In this paper, westudy the application of an ttMM(hidden Markov model) to the problem of representing protein sequencesby a stochastic motif. Astochastic protein motif represents ...
Several published reports show that instancebased learning algorithms yield high classification accuracies and have low storage requirements during supervised learning application...
A voting rule is an algorithm for determining the winner in an election, and there are several approaches that have been used to justify the proposed rules. One justification is t...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
In this paper we present a swarm grammar system that makes use of bio-inspired mechanisms of reproduction, communication and construction in order to build three-dimensional struc...