Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Results found: 2

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  computational complexity
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1
Content available remote

An effective system of sports competition management

100%
SZOSTEK R.
Operations Research and Decisions
|
2011
|
vol. 21
|
issue 1
65-75
EN
An innovatory system of managing sports competitions has been presented. Its advantages with regard to other currently used systems are discussed. A theorem connected with such a system has been presented in the last section of the paper. Sports competitions aim to establish a ranking of the participating teams. This consists of sorting teams according to a quality which can be thought of as the ability to win matches. Direct measurement of this quality is not possible, since the ability to win matches depends on a great variety of factors being difficult to determine. Nevertheless, it is possible to compare any two teams if they play a match. These matches are played under normal rules. In turn, all the rules valid during sports competitions, outside the matches, make a system of sport competition. Sorting sports teams differs from typical problems of sorting. The result of a comparison of teams is sometimes misleading. It happens that a team with a greater ability to win matches loses a match to a team with a smaller ability to win matches. Thus, the problem of sorting teams is a probabilistic problem. Due to this reason, traditional sorting methods are ineffective in terms of managing sports competitions.
2

On Algorithmic Properties of Propositional Inconsistency-Adaptive Logics

86%
Odintsov S. P., Speranski S. O.
Logic and Logical Philosophy
|
2012
|
vol. 21
|
issue 3
209-228
EN
The present paper is devoted to computational aspects of propo- sitional inconsistency-adaptive logics. In particular, we prove (relativized versions of) some principal results on computational complexity of deriv- ability in such logics, namely in cases of CLuNrand CLuNm, i.e., CLuN supplied with the reliability strategy and the minimal abnormality strategy, respectively.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.