Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 2004

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: branch-and-cut algorithm

Sortuj według:

Ogranicz wyniki do:

An exact algorithm for design of content delivery networks in MPLS environment

Walkowiak K.

Journal of Telecommunications and Information Technology

2004

nr 2

13-22

Content delivery network (CDN) is an efficient and inexpensive method to improve Internet service quality. In this paper we formulate an optimisation problem of replica location in a CDN using MPLS techniques. A novelty, comparing to previous work on this subject, is modelling the network flow as connection-oriented and introduction of capacity constraint on network links to the problem. Since the considered optimisation problem is NP-complete, we propose and discuss exact algorithm based on the branch-and-cut and branch-and-bound methods. We present results of numerical experiments showing comparison of branch-and-cut and branch-and-bound methods.

Evolutionary algorithm for a reconstruction of NOE paths in NMR spectra of RNA chains

Błażewicz J., Szachniuk M., Wojtowicz A.

Bulletin of the Polish Academy of Sciences. Technical Sciences

2004

Vol. 52, nr 3

221-230

Resonance-assignment remains one of the hardest stages in RNA tertiary structure determination with the use of Nuclear Magnetic Resonanse spectroscopy. We propose an evolutionary algorithm being a tool for an automatization of the procedure. NOE pathway, which determines the assignments, is constructed during an analysis of possible connections between resonances within aromatic and anomeric region of 2D-NOESY spectra resulting from appropriate NMR experiments. Computational tests demonstrate the performance of the evolutionary algorithm as compared with the exact branch-and-cut procedure applied for the experimental and simulated spectral data for RNA molecules.