PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 9

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  combinatorial problems
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available The number of stable matchings in models of the Gale-Shapley type with preferences given by partial orders
Drgas-Burchardt E.
Operations Research and Decisions
|
2015
|
Vol. 25, No. 1
5--15
EN
From the famous Gale–Shapley theorem we know that each classical marriage problem admits at least one stable matching. This fact has inspired researchers to search for the maximum number of possible stable matchings, which is equivalent to finding the minimum number of unstable matchings among all such problems of size n. In this paper, we deal with this issue for the Gale–Shapley model with preferences represented by arbitrary partial orders. Also, we discuss this model in the context of the classical Gale–Shapley model.
2
Content available A greedy algorithm for the DNA sequencing by hybridization with positive and negative errors and information about repetitions
Kwarciak K., Formanowicz P.
Bulletin of the Polish Academy of Sciences. Technical Sciences
|
2011
|
Vol. 59, nr 1
111-115
EN
In this paper a greedy algorithm for some variants of the sequencing by hybridization method is presented. In the standard version of the method information about repetitions is not available. In the paper it is assumed that a partial information of this type is a part of the problem instance. Here two simple but realistic models of this information are taken into consideration. The first one assumes it is known if a given element of a spectrum appears in the target sequence once or more than once. The second model uses the knowledge is a given element of a spectrum occurs in the analyzed sequence once, twice or at least three times. The proposed greedy algorithm solves the variant of the problem with positive and negative errors. Results of a computational experiment are reported which, among others, confirm that the additional information leads to the improvement of the obtained solutions. They also show that the more precise model of information increases the quality of reconstructed sequences.
3
Content available Modelowanie wielowymiarowych wyrażeń w języku MDX
Mazur Ł.
Automatyka / Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie
|
2010
|
T. 14, z. 1
63-84
PL
Artykuł opisuje techniki modelowania zapytań dla modeli analitycznych, wykorzystując język wielowymiarowych wyrażeń (MDX). Przedstawiono narzędzie wspierające wszelkiego rodzaju złożone analitycznie konstrukcje odnoszące się do kostek danych. Zawarto także opis funkcji działających na zbiorach danych jak również zaproponowane przez autora rozwiązania. Wymienione aspekty czynią omawiany język bardzo przydatnym narzędziem wsparcia dla analityków tworzących skomplikowane raporty o dużej złożoności konstrukcyjnej.
EN
The article describes the technique of query modeling for analytical models, using the language of multidimensional expressions (MDX). It is the supporting tool to the all manner of complex query in data cubes. Article include also the description of functions which works on member sets and authors examples of each solutions. All talked aspects of language makes it very useful tool for support analysis in creating complicated reports on large constructional complexity.
4
Content available remote Problemy izotermicznego sekwencjonowania przez hybrydyzację z informacją o powtórzeniach
Formanowicz P.
Przegląd Elektrotechniczny
|
2008
|
R. 84, nr 9
103-107
PL
W pracy przedstawiono formalne definicje różnych wariantów problemu izotermicznego sekwencjonowania przez hybrydyzację z dodatkową informacją o powtórzeniach. W większośći przypadków podano złożoność obliczeniową oraz sformuowano odpowiedniki grafowe rozważanych problemów.
EN
In the paper formal definitions of many variants of the isotherimc sequencing by hybridization problem with additional information about repetitions are presented. For most of the problems their computational complexity is determined and graph theoretical counterparts are also formulated.
5
Content available Programowanie z ograniczeniami przy wykorzystaniu ILOG OPL
Mazur Ł.
Automatyka / Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie
|
2008
|
T. 12, z. 2
407-422
PL
W artykule przedstawiono przegląd metody programowania z ograniczeniami w środowisku ILOG OPL. Możliwości tej metody programowania oraz mocne wsparcie dla niej ze strony ILOG Solvera zostały tutaj zwięźle opisane. Omawiane metodyki programowania są bardzo przydatne do rozwiązywania problemów kombinatorycznych, decyzyjnych oraz optymalizacyjnych.
EN
The review of constraint programming method in ILOG OPL environment was presented in this article. Possibilities of this method as well as strong support for it from the ILOG Solver, they became concisely here described. The described methodologies of constraint programming are very useful to the solving of hard combinatorical, decision and optimization problems.
6
Content available A note on the computation of ordered supported non-dominated solutions in the bi-criteria minimum spanning tree problems
Silva C. G., Cli'maco J. C. N.
Journal of Telecommunications and Information Technology
|
2007
|
nr 4
11-15
EN
This paper presents a new procedure for computing the set of supported non dominated solutions of bi-criteria minimum spanning tree problems in ordered manner. The procedure is based on the systematic detection of edges which must be replaced in one efficient solution to obtain the adjacent one, in the criteria space. This new approach avoids solving unnecessary problems and makes use of previous computations.
7
Content available remote DNA sequencing by hybridization with additional information available
Formanowicz P.
Computational Methods in Science and Technology
|
2005
|
Vol. 11, nr 1
21-29
EN
In classical DNA sequencing by hybridization it is assumed that the information obtained in the biochemical stage of the method is a set of the l-tuples composing the target sequence. It means that the information concerning the number of the repeated l-tuples is not available. Such an assumption was justified by the DNA chip technology constraints. However, nowadays some approximate information about l-tuple multiplicities can be obtained in the experiments, where DNA chips are used. It was a motivation for formulating combinatorial problems which arise when such additional information is taken into account. The goal of this paper is to formulate and classify these problems, what should establish a good starting point for further research concerning algorithmic methods solving DNA sequencing problems with multiplicity information. Moreover, the computational complexity of the new problems is determined, which in most cases is analogous to the complexity of their classical counterparts.
8
Content available remote DNA computing
Formanowicz P.
Computational Methods in Science and Technology
|
2005
|
Vol. 11, nr 1
11-20
EN
DNA computing is an alternative method of performing computations. It is based on the observation that in general it is possible to design a series of biochemical experiments involving DNA molecules which is equivalent to processing information encoded in these molecules. In classical computing devices electronic logic gates are elements which allow for storing and transforming information. Designing of an appropriate sequence or a net of “store” and “transform” operations (in a sense of building a device or writing a program) is equivalent to preparing some computations. In DNA computing the situation is analogous. The main difference is the type of computing devices, since in this new method of computing instead of electronic gates DNA molecules are used for storing and transforming information. From this follows that the set of basic operations is different in comparison to electronic devices but the results of using them may be similar. Moreover, the inherent massive parallelism of DNA computing may lead to methods solving some intractable computational problems. In this paper basic principles of DNA computing are described and examples of DNA based algorithms solving some combinatorial problems are presented.
9
Content available remote Mean Squared Load Criteria for Scheduling Independent Tasks
Dzemyda G.
International Journal of Applied Mathematics and Computer Science
|
1999
|
Vol. 9, no 4
939-954
EN
Results of this paper extend the set of criteria which characterize the scheduling quality as well as the set of possible scheduling strategies. A new view on the minimum makespan criterion is presented in terms of the mean squared load of processing units. This leads in turn to the development of new scheduling algorithms. The interaction between processes of minimizing the new criteria and the maximum finishing time (makespan of the schedule) was discovered. We show the possibility of minimizing the maximum finishing time by minimizing the new criteria that characterize the mean squared load of processing units. Moreover, the optimal workload of processing units determined with the use of the proposed criteria is usually smoother (more balanced) than that found for traditional ones.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.