Efficient offline algorithmic techniques for several packet routing problems in distributed systems.
Eigenvalues and the max-cut problem
Eine strenge Begründung dynamischer Programme und die Bestimmung ausgezeichneter Knoten- und Kantenmengen in endlichen Graphen.
El problema del árbol minimal para grafos difusos.
Basándonos en algunas definiciones previas, se analiza el problema del árbol generador difuso. En primer lugar se trata su existencia y después se encuentra el árbol generador difuso de mínimo costo mediante una descomposición por α-cortes. El estudio se realiza para dos estructuras diferentes de costos.
Emotion learning: Solving a shortest path problem in an arbitrary deterministic environment in linear time with an emotional agent
The paper presents an algorithm which solves the shortest path problem in an arbitrary deterministic environment with n states with an emotional agent in linear time. The algorithm originates from an algorithm which in exponential time solves the same problem, and the agent architecture used for solving the problem is an NN-CAA architecture (neural network crossbar adaptive array). By implementing emotion learning, the linear time algorithm is obtained and the agent architecture is modified. The...
Énumération des chemins -minimum admissibles entre deux points
Environmentally conditioned self-reproduction
Erlang distributed activity times in stochastic activity networks
It is assumed that activity times in stochastic activity networks (SANs) are independent Erlang random variable (r.v.). A recurrence method of determining the th moments of the completion time is presented. Applications are provided for illustration and are used to evaluate the applicability and appropriateness of the Erlang model to represent activity network.
Errata ao artigo "Um algoritmo exacto para o problema da p-mediana" (Port. Math., 42(2) (1983-1984), 151-162)
Experiments with variants of ant algorithms.
A number of extensions of Ant System, the first ant colony optimization (ACO) algorithm, were proposed in the literature. These extensions typically achieve much improved computational results when compared to the original Ant System. However, many design choices of Ant System are left untouched including the fact that solutions are constructed, that real-numbers are used to simulate pheromone trails, and that explicit pheromone evaporation is used. In this article we experimentally investigate...