Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "constraint" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 127
Tytuł:
Models and tools for improving efficiency in Constraint Logic Programming
Autorzy:
Ligęza, A.
Powiązania:
https://bibliotekanauki.pl/articles/375886.pdf
Data publikacji:
2011
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
constraint satisfaction problem (CSP)
constraint programming
constraint logic programming
Opis:
Constraint Satisfaction Problems typically exhibit strong combinatorial explosion. In this paper we present some models and techniques aimed at improving efficiency in Constraint Logic Programming. A hypergraph model of constraints is presented and an outline of strategy planning approach focused on entropy minimization is put forward. An example cryptoaritmetic problem is explored in order to explain the proposed approach.
Źródło:
Decision Making in Manufacturing and Services; 2011, 5, 1-2; 69-78
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Position-force control of mobile manipulator – nonadaptive and adaptive case
Autorzy:
Kaczmarek, M.
Domski, W.
Mazur, A.
Powiązania:
https://bibliotekanauki.pl/articles/230067.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
holonomic constraint
nonholonomic constraint
parametric uncertainty
adaptive control
Opis:
This article presents a control algorithm for nonholonomic mobile manipulators with a simple, geometric holonomic constraint imposed on the robot’s arm. A mathematical model in generalized, auxiliary and linearized coordinates is presented, as well as the constrained dynamics of the robotic system. A position-force control law is proposed, both for the fully known robot’s model, as well as for the model with parametric uncertainty in the dynamics. Theoretical considerations are supported by the results of computer simulations.
Źródło:
Archives of Control Sciences; 2017, 27, 4; 487-503
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Permutation, no-wait, no-idle flow shop problems
Autorzy:
Makuchowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/229973.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
flow shop problem
permutation constraint
no-wait constraint
no-idle constraint
permutation-graph models
Opis:
The paper compares the schedules of different variants of the flow shop problem, i.e. permutation, no waiting and no idle flow shop problems. It is assessed the impact of the constraints on the extension of the schedules and correlations of the length of the schedules for these variants. It is also examined the effectiveness of a set of insert type algorithms. The efficiency of the algorithms is tested on well-known literature benchmarks.
Źródło:
Archives of Control Sciences; 2015, 25, 2; 189-199
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Flow-capture location model with link capacity constraint over a mixed traffic network
Autorzy:
Liu, Ping
Cao, Jinde
Luo, Yiping
Guo, Jianhua
Huang, Wei
Powiązania:
https://bibliotekanauki.pl/articles/2147143.pdf
Data publikacji:
2022
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
traffic assignment problem
link capacity constraint
charging location
pathmdistance constraint
Opis:
This paper constructs and settles a charging facility location problem with the link capacity constraint over a mixed traffic network. The reason for studying this problem is that link capacity constraint is mostly insufficient or missing in the studies of traditional user equilibrium models, thereby resulting in the ambiguous of the definition of road traffic network status. Adding capacity constraints to the road network is a compromise to enhance the reality of the traditional equilibrium model. In this paper, we provide a two-layer model for evaluating the efficiency of the charging facilities under the condition of considering the link capacity constraint. The upper level model in the proposed bi-level model is a nonlinear integer programming formulation, which aims to maximize the captured link flows of the battery electric vehicles. Moreover, the lower level model is a typical traffic equilibrium assignment model except that it contains the link capacity constraint and driving distance constraint of the electric vehicles over the mixed road network. Based on the Frank-Wolfe algorithm, a modified algorithm framework is adopted for solving the constructed problem, and finally, a numerical example is presented to verify the proposed model and solution algorithm.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2022, 12, 3; 223--234
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
CP-based decision support package for production flow planning - an SME perspective
Autorzy:
Bzdyra, K.
Tomczuk-Piróg, I.
Powiązania:
https://bibliotekanauki.pl/articles/1395582.pdf
Data publikacji:
2006
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
constraint logic programming
decision support
flow planning
constraint satisfaction problem (CSP)
Opis:
Solving complex, decision-making problems requires application of decision support systems. The best solving strategy can be defined for each particular problem. The strategy refers to a sequence solving elementary subproblems. The aim of the paper is to present the evaluating criterion to estimate the efficiency of searching strategies. The criterion proposed offers a possibility to estimate the time needed to solve a constraint satisfaction problem. An illustrative example is provided.
Źródło:
Applied Computer Science; 2006, 2, 1; 100-109
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wyrok Sądu Metropolitalnego w Katowicach (c. Sobański) z 10.7.2003 z tytułu symulacji i przymusu
Autorzy:
Sobański, Remigiusz
Powiązania:
https://bibliotekanauki.pl/articles/662850.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Kardynała Stefana Wyszyńskiego w Warszawie
Tematy:
symulacja
przymus
simulation
constraint
Źródło:
Ius Matrimoniale; 2004, 15, 9; 231-240
1429-3803
2353-8120
Pojawia się w:
Ius Matrimoniale
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Monotonicity as an effective theory of morphosyntactic variation
Autorzy:
Graf, Thomas
Powiązania:
https://bibliotekanauki.pl/articles/103811.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:
monotonic functions
syncretism
typology
∗ABA-generalization
Person Case Constraint
Gender Case Constraint
Opis:
One of the major goals of linguistics is to delineate the possible range of variation across languages. Recent work has identified a surprising number of typological gaps in a variety of domains. In morphology, this includes stem suppletion, person pronoun syncretism, case syncretism, and noun stem allomorphy. In morphosyntax, only a small number of all conceivable Person Case Constraints and Gender Case Constraints are found. While various proposals have been put forward for each individual domain, few attempts have been made to give a unified explanation of the limited typology across all domains. This paper presents a novel account that deliberately abstracts away from the usual details of grammatical description in order to provide a domain-agnostic explanation of the limits of typological variation. This is achieved by combining prominence hierarchies, e.g. for person and case, with mappings from those hierarchies to the relevant output forms. As the mappings are required to be monotonic, only a fraction of all conceivable patterns can be instantiated.
Źródło:
Journal of Language Modelling; 2019, 7, 2; 3-47
2299-856X
2299-8470
Pojawia się w:
Journal of Language Modelling
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Constrained Maximum Available Frequency Slots on Path Based Online Routing and Spectrum Allocation for Dynamic Traffic in Elastic Optical Networks
Autorzy:
Khan, Akhtar Nawaz
Powiązania:
https://bibliotekanauki.pl/articles/1844474.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
elastic optical networks
routing and spectrum allocation
blocking probability
continuity constraint
contiguity constraint
Opis:
Elastic optical networking is a potential candidate to support dynamic traffic with heterogeneous data rates and variable bandwidth requirements with the support of the optical orthogonal frequency division multiplexing technology (OOFDM). During the dynamic network operation, lightpath arrives and departs frequently and the network status updates accordingly. Fixed routing and alternate routing algorithms do not tune according to the current network status which are computed offline. Therefore, offline algorithms greedily use resources with an objective to compute shortest possible paths and results in high blocking probability during dynamic network operation. In this paper, adaptive routing algorithms are proposed for shortest path routing as well as alternate path routing which make routing decision based on the maximum idle frequency slots (FS) available on different paths. The proposed algorithms select an underutilized path between different choices with maximum idle FS and efficiently avoids utilizing a congested path. The proposed routing algorithms are compared with offline routing algorithms as well as an existing adaptive routing algorithm in different network scenarios. It has been shown that the proposed algorithms efficiently improve network performance in terms of FS utilization and blocking probability during dynamic network operation.
Źródło:
International Journal of Electronics and Telecommunications; 2020, 66, 4; 707-714
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Constraint-based scheduling in Oz/Mozart
Autorzy:
Sitek, P.
Wikarek, J.
Banaszak, Z.
Powiązania:
https://bibliotekanauki.pl/articles/118013.pdf
Data publikacji:
2006
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
constraint programming
decision support
scheduling
Opis:
In this paper we present how scheduling problems can be solved in the concurrent constraint programming (CCP) language Oz. Oz is the first high- level constraint language, which offers programmable search, modularity, expressiveness and an interface to invent new constraints using C++. As an example of scheduling problem the job-shop scheduling problem with manpower resources representation was considered. The objective discussed here is the minimization of the makespan. Allocating manpower to the jobs is more complicated than allocating machines, as different jobs and operations require different manpower. This problem is strongly NP-hard. We proposed the constraint programming (CP) based approach to decision support in this environment. The most important features of CP are declarative problem modeling, allowing a clear separation between the problem statement (variables and constraints) and the resolution of the problem.
Źródło:
Applied Computer Science; 2006, 2, 1; 83-99
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Towards intelligent decision support for application service providing
Autorzy:
Sitek, P.
Wikarek, J.
Powiązania:
https://bibliotekanauki.pl/articles/118015.pdf
Data publikacji:
2007
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
constraint programming
decision support
ASP
Opis:
Decision support systems (DSS) provide decision-makers with an interactive environment for analyses of information with various models to help solve unstructured and NP-hard problems. The important aspect of DSS is a technical and technological approach to the design and implementation of the above systems. A traditional approach to DSS engineering and implementation requires a great deal of effort for its maintenance. However, the enterprises would like to concentrate on its core competitiveness instead of non-core activities like IT maintenance. As a result of this, IT outsourcing has became a very popular event. Thus there is a growing need for intelligent decision support tools capable of assisting a decision maker in many problems in SMEs (Small and Medium Sized Enterprises). In this paper we present the use of declarative programming (constraint logic programming and relational SQL database) as an environment and framework for such decision support systems in an application service providing (ASP) model.
Źródło:
Applied Computer Science; 2007, 3, 1; 125-142
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Implementation of declarative framework for decision support system in scheduling problems
Autorzy:
Sitek, P.
Wikarek, J.
Powiązania:
https://bibliotekanauki.pl/articles/117767.pdf
Data publikacji:
2007
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
constraint programming
decision support
scheduling
Opis:
Scheduling problems appear frequently at different levels of decisions. They are usually characterized by many types of constraints, which make them unstructured and difficult to solve (NP-complete). Traditional mathematical programming approaches are deficient because their representation of constraints is artificial (using 0-1 variables). Unlike traditional approaches, constraint logic programming (CLP) provides for a natural representation of heterogeneous constraints. In CLP we state the problem requirements by constraints; we do not need to specify how to meet these requirements. In this paper we propose a declarative framework for decision support system (DSS) for constrained search problems implemented by CLP and relational SQL database. We illustrate this concept by the implementation of a DSS for scheduling problems with external resources in different production organization environments.
Źródło:
Applied Computer Science; 2007, 3, 2; 69-86
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Sémiotique des démonstratifs cataphoriques
Semiotics of cataphoric demonstratives
Autorzy:
Kleiber, Georges
Powiązania:
https://bibliotekanauki.pl/articles/31341261.pdf
Data publikacji:
2023
Wydawca:
Wydawnictwo Uniwersytetu Śląskiego
Tematy:
Cataphoric demonstratives
cataphor
anaphora
endophoric
exophoric
subsequent
ontological constraint
constructional constraint
adjacency
referent
referential identification
Opis:
Nous nous proposons ici de poursuivre l’analyse des démonstratifs cataphoriques (DC) en nous penchant cette fois-ci sur leur fonctionnement référentiel proprement dit : comment s’effectue exactement la saisie cataphorique de leur référent ? Ou, dit autrement, comment nous font-ils atteindre le référent visé ? Quelle est précisément la procédure interprétative mise en jeu ? Notre enquête comportera quatre parties. La première, très rapide, rappellera pourquoi les DC sont habituellement, aussi bien dans les typologies anciennes que récentes, rangés avec les démonstratifs anaphoriques dans la catégorie des démonstratifs endophoriques. Nous montrerons dans la deuxième partie qu’une telle classification, pour justifiée qu’elle puisse être si l’on prend uniquement en compte le critère du passage par le texte (soit antérieur ou subséquent), présente néanmoins un inconvénient majeur, celui de masquer l’asymétrie cognitive qu’il y a entre les DC et les démonstratifs anaphoriques. Cette asymétrie cognitive conduit à abandonner la piste classique de l’opposition intra-endophorique entre DC et démonstratifs anaphoriques et pousse à emprunter une autre voie comparative, qui conduit aux démonstratifs ostensifs. La comparaison que nous opèrerons, dans les troisième et quatrième parties, entre les démonstratifs ostensifs et les DC, en même temps qu’elle établira la vicinité cognitive des deux types de démonstratifs, permettra de mettre au jour, de façon plus précise et plus juste qu’auparavant, quel est le réel fonctionnement des DC.
The studies of anaphoric expressions have shown that we can and must link the stable results acquired over the last forty years on their functioning to more recent socio-cognitive, taxonomic, multimodal, etc. perspectives and examine and explain two aspects of cataphoric demonstratives (CDs): on the one hand, their constructional scheme and, on the other, the formal and semantic nature of their subsequent or postcedent. We propose here to continue this analysis of CDs, this time looking at their referential operation as such and asking the question: how do CDs make us reach the intended referent? What precisely is the interpretative procedure involved? Our analyses show that rather than directly contrasting CDs with anaphoric demonstratives, it is more relevant and, therefore, more fruitful to compare them directly with gestural demonstratives. As we have seen, the two uses of demonstratives correspond to the same cognitive situation, that of introducing a new referent into discourse memory. This cognitive kinship gives rise to a common semiotic hybridity and, consequently, a referential operation, which we have detailed in nine points, that turns out to be largely identical, the differences observed being directly due to the difference in the nature of the index.
Źródło:
Neophilologica; 2023, 35; 1-23
0208-5550
2353-088X
Pojawia się w:
Neophilologica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decision support tool for projects portfolio prototyping
Autorzy:
Bocewicz, G.
Bach, I.
Banaszak, Z.
Powiązania:
https://bibliotekanauki.pl/articles/117707.pdf
Data publikacji:
2008
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
scheduling
constraint programming
decision support system
Opis:
Constraint Programming (CP) is an emergent software technology for declarative description and effective solving of large combinatorial problems especially in the area of projects portfolio prototyping. The paper deals with multi-resource and multi-criteria problem in which more than one shared renewable resource type may be required by manufacturing operation and the availability of each type is time-windows limited. The problem belongs to a class of NP-complete ones. The aim of the paper is to present a knowledge based and CP-driven approach to resource allocation conflicts resolution framework. Proposed framework stands behind a methodology aimed at task oriented DSS tolls designing. The Portfolio Project Prototyping System designed due to this methodology provides a prompt and interactive service to a set of routine queries stated both in straight and reverse way. Multiple illustrative examples are discussed.
Źródło:
Applied Computer Science; 2008, 4, 2; 43-62
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
CP-based decision support for scheduling
Autorzy:
Relich, M.
Powiązania:
https://bibliotekanauki.pl/articles/118311.pdf
Data publikacji:
2011
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
project management
constraint programming
alternative projects
Opis:
The paper presents the declarative approach to design of a reference model aimed at project prototyping. The reference model contains the finite set of decision variables, their domains and linking those constraints, i.e. can be seen as a kind of Constraint Satisfaction Problem. Consequently, the model considered can be treated as a knowledge base specifying both a class of enterprises and the projects that could be conducted on their base. So, the model provides a platform for rapid prototyping of alternative versions of project scheduling. The routine queries can be formulated in the straight or reverse way. In that context, the proposed reference model can be implemented in constraint programming (CP) techniques
Źródło:
Applied Computer Science; 2011, 7, 1; 7-17
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Constraint As an Ethical Postulate in the Context of Ecological Limits
Autorzy:
Stachowska, Iwona
Powiązania:
https://bibliotekanauki.pl/articles/781454.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Tematy:
limitation
ecological constraint
degrowth
environmental ethics
Opis:
The problem of natural resources being finite as well as the capability of ecosystems and the biosphere to assimilate the effects of economic activity on the one hand, and growing economic discrepancies on the other raise a question mark over the chase after the unrestrained economic growth. In the search for alternative models of thinking and development a significant role of constraint is being more and more emphasized. In the case of ecological barriers limitation of using non-renewable resources, greenhouse gases emissions, excessive consumption and production seems to be a reasonable strategy that manifests our care for the natural environment. The aim of the paper is to demonstrate that the postulate of constraint present in the de-growth model in the form proposed by Tim Jackson and Serge Latouche apart from a quantitative dimension has, above all, a qualitative and ethically orientated dimension. Constraint conceived in the above way stays close to terms like moderation, restraint, sustainability, i.e. such terms that possess solid ethical foundations and constitute an important base for environmental ethics. 
Źródło:
Ethics in Progress; 2016, 7, 1; 1-20
2084-9257
Pojawia się w:
Ethics in Progress
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 127

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies