All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 5 Next

Displaying 81 – 100 of 174

Showing per page

Minimization of the total completion time for asynchronous transmission in a packet data-transmission system

Adam Piórkowski, Jan Werewka (2010)

International Journal of Applied Mathematics and Computer Science

The minimization of the total completion time for asynchronous transmission in distributed systems is discussed. Attention is focused on the problem of message scheduling on part of the sender. Messages to be sent form a queue, and the order in which they are to be sent has to be first established. The methods of scheduling messages, which minimize the factor of the total completion time, are presented herein. The message-scheduling problem becomes considerably complicated when the stream of data...

Minimum convex-cost tension problems on series-parallel graphs

Bruno Bachelet, Philippe Mahey (2003)

RAIRO - Operations Research - Recherche Opérationnelle

We present briefly some results we obtained with known methods to solve minimum cost tension problems, comparing their performance on non-specific graphs and on series-parallel graphs. These graphs are shown to be of interest to approximate many tension problems, like synchronization in hypermedia documents. We propose a new aggregation method to solve the minimum convex piecewise linear cost tension problem on series-parallel graphs in O ( m 3 ) operations.

Minimum convex-cost tension problems on series-parallel graphs

Bruno Bachelet, Philippe Mahey (2010)

RAIRO - Operations Research

We present briefly some results we obtained with known methods to solve minimum cost tension problems, comparing their performance on non-specific graphs and on series-parallel graphs. These graphs are shown to be of interest to approximate many tension problems, like synchronization in hypermedia documents. We propose a new aggregation method to solve the minimum convex piecewise linear cost tension problem on series-parallel graphs in O(m3) operations.

Minimum vertex ranking spanning tree problem for chordal and proper interval graphs

Dariusz Dereniowski (2009)

Discussiones Mathematicae Graph Theory

A vertex k-ranking of a simple graph is a coloring of its vertices with k colors in such a way that each path connecting two vertices of the same color contains a vertex with a bigger color. Consider the minimum vertex ranking spanning tree (MVRST) problem where the goal is to find a spanning tree of a given graph G which has a vertex ranking using the minimal number of colors over vertex rankings of all spanning trees of G. K. Miyata et al. proved in [NP-hardness proof and an approximation algorithm...

Mining indirect association rules for web recommendation

Przemysław Kazienko (2009)

International Journal of Applied Mathematics and Computer Science

Classical association rules, here called “direct”, reflect relationships existing between items that relatively often co-occur in common transactions. In the web domain, items correspond to pages and transactions to user sessions. The main idea of the new approach presented is to discover indirect associations existing between pages that rarely occur together but there are other, “third” pages, called transitive, with which they appear relatively frequently. Two types of indirect associations rules...

Mixed Theories

Radev, Slavian (2007)

Serdica Journal of Computing

In the present paper we investigate the life cycles of formalized theories that appear in decision making instruments and science. In few words mixed theories are build in the following steps: Initially a small collection of facts is the kernel of the theory. To express these facts we make a special formalized language. When the collection grows we add some inference rules and thus some axioms to compress the knowledge. The next step is to generalize these rules to all expressions in the formalized language....

Mixing time for the Ising model : a uniform lower bound for all graphs

Jian Ding, Yuval Peres (2011)

Annales de l'I.H.P. Probabilités et statistiques

Consider Glauber dynamics for the Ising model on a graph of n vertices. Hayes and Sinclair showed that the mixing time for this dynamics is at least nlog n/f(Δ), where Δ is the maximum degree and f(Δ) = Θ(Δlog2Δ). Their result applies to more general spin systems, and in that generality, they showed that some dependence on Δ is necessary. In this paper, we focus on the ferromagnetic Ising model and prove that the mixing time of Glauber dynamics on any n-vertex graph is at least (1/4 + o(1))nlog n....

Mixture of experts architectures for neural networks as a special case of conditional expectation formula

Jiří Grim (1998)

Kybernetika

Recently a new interesting architecture of neural networks called “mixture of experts” has been proposed as a tool of real multivariate approximation or prediction. We show that the underlying problem is closely related to approximating the joint probability density of involved variables by finite mixture. Particularly, assuming normal mixtures, we can explicitly write the conditional expectation formula which can be interpreted as a mixture-of- experts network. In this way the related optimization...

Currently displaying 81 – 100 of 174