Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
When reliable prior bounds on the acceptable errors between the data and corresponding model outputs are available, bounded-error estimation techniques make it possible to characte...
Luc Jaulin, Michel Kieffer, Eric Walter, Dominique...
The Pseudogene.org database serves as a comprehensive repository for pseudogene sequence annotation. The definition of a pseudogene varies within the literature, resulting in sign...
John E. Karro, Yangpan Yan, Deyou Zheng, Zhaolei Z...
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...