Search results for "D algorithm"

Modelling complex dynamics and distributed generation of knowledge with bacterial-based algorithms

2014

Este estudio tuvo como objetivo demostrar que las sociedades conectadas y heterogéneas con intercambios entre pares (P2P) son más resilientes que las centralizadas y homogéneas. En el modelado basado en agentes, se modelizan agentes con racionalidad limitada que interactúan en un entorno común guiado por reglas locales, lo que lleva a Sistemas Adaptativos Complejos (CAS) que se denominan 'sociedades artificiales'. Estos modelos simplificados de sociedades humanas crecen de abajo hacia arriba en entornos computacionales y pueden utilizarse como un laboratorio para probar algunas hipótesis. Hemos demostrado que en un modelo basado en interacciones libres entre agentes autónomos, los resultado…

Counting by Statistics on Search Trees: Application to Constraint Satisfaction Problems

1997

In 1975, Knuth proposed a simple statistical method for investigating search trees. We use this technique for estimating the number of solutions of constraint satisfaction problem CSP and boolean satisfiability problem SAT instances. We show that, depending on domain reductions, tree-based estimates have a lower variance than estimates based on uniform sampling from the search space. Nevertheless, because the variance remains extremely high in the general case, a confidence interval cannot be derived, but a lower bound of the number of solutions. These results are confirmed by many experiments.

Linear-size suffix tries

2016

Suffix trees are highly regarded data structures for text indexing and string algorithms [MCreight 76, Weiner 73]. For any given string w of length n = | w | , a suffix tree for w takes O ( n ) nodes and links. It is often presented as a compacted version of a suffix trie for w, where the latter is the trie (or digital search tree) built on the suffixes of w. Here the compaction process replaces each maximal chain of unary nodes with a single arc. For this, the suffix tree requires that the labels of its arcs are substrings encoded as pointers to w (or equivalent information). On the contrary, the arcs of the suffix trie are labeled by single symbols but there can be Θ ( n 2 ) nodes and lin…

Fully Automatic Trunk Packing with Free Placements

2010

We present a new algorithm to compute the volume of a trunk according to the SAE J1100 standard. Our new algorithm uses state-of-the-art methods from computational geometry and from combinatorial optimization. It finds better solutions than previous approaches for small trunks.

A sufficient condition for the instability of theq-d algorithm

1959

Continuous reformulations and heuristics for the Euclidean travelling salesperson problem

2008

We consider continuous reformulations of the Euclidean travelling salesperson problem (TSP), based on certain clustering problem formulations. These reformulations allow us to apply a generalisation with perturbations of the Weiszfeld algorithm in an attempt to find local approximate solutions to the Euclidean TSP.

[Editorial] Special issue on computational intelligence and nature-inspired algorithms for real-world data analytics and pattern recognition

2018

Cagnoni, S., & Castelli, M. (2018). [Editorial]. Special issue on computational intelligence and nature-inspired algorithms for real-world data analytics and pattern recognition. Algorithms, 11(3), 1-2. DOI: 10.3390/a11030025 This special issue of Algorithms is devoted to the study of Computational Intelligence and Nature-Inspired Algorithms for Real-World Data Analytics and Pattern Recognition. The special issue considered both theoretical contributions able to advance the state-of-the-art in this field and practical applications that describe novel approaches for solving real-world problems. published

An efficient distributed algorithm for generating and updating multicast trees

2006

As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distribut…

Krill herd algorithm-based neural network in structural seismic reliability evaluation

2018

ABSTRACTIn this research work, the relative displacement of the stories has been determined by means of a feedforward Artificial Neural Network (ANN) model, which employs one of the novel methods for the optimization of the artificial neural network weights, namely the krill herd algorithm. For the purpose of this work, the area, elasticity, and load parameters were the input parameters and the relative displacement of the stories was the output parameter. To assess the precision of the feedforward (FF) model optimized using the Krill Herd Optimization (FF-KH) algorithm, comparison of results has been performed relative to the results obtained by the linear regression model, the Genetic Alg…

Indexing a sequence for mapping reads with a single mismatch

2014

Mapping reads against a genome sequence is an interesting and useful problem in computational molecular biology and bioinformatics. In this paper, we focus on the problem of indexing a sequence for mapping reads with a single mismatch. We first focus on a simpler problem where the length of the pattern is given beforehand during the data structure construction. This version of the problem is interesting in its own right in the context of the next generation sequencing. In the sequel, we show how to solve the more general problem. In both cases, our algorithm can construct an efficient data structure in time and space and can answer subsequent queries in time. Here, n is the length of the s…