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ę "efficient" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 19
Tytuł:
Multiobjective variational programming under generalized (V, p)-B-type I functions
Autorzy:
Khazafi, K.
Rueda, N.
Enflo, P.
Powiązania:
https://bibliotekanauki.pl/articles/970961.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
multiobjective variational programming
efficient solution
proper efficient solution
generalized (V, p)-B-type I functions
sufficient conditions
mixed type duality rusults
Opis:
In this paper, we generalize the (V, p)-invexity denned for nonsmooth multiobjective fractional programming by Mishra, Rueda and Giorgi (2003) to variational programming problems by defining new classes of vector- valued functions called (V, p)-B-type I and generalized (V, p)-B-type I. Then we use these new classes to derive various sufficient optimality conditions and mixed type duality results.
Źródło:
Control and Cybernetics; 2009, 38, 2; 555-572
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Changes of the set of efficient solutions by extending the number of objectives and its evaluation
Zmiany zbioru rozwiązań sprawnych przy zwiększeniu liczby celów i ich ocena
Autorzy:
Malinowska, A.
Powiązania:
https://bibliotekanauki.pl/articles/206753.pdf
Data publikacji:
2002
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
nieistotna funkcja celu
rozwiązania sprawne
zadanie optymalizacji wektorowej
efficient solutions
nonessential objective function
vector optimization problem
Opis:
In this paper the vector optimization problem P with continuous and convex objective functions on a compact convex feasible set is considered. We form a new vector optimisation problem P* from P by adding an objective function to the problem P. The necessary and sufficient conditions for the sets of efficient solutions of these two problems to be equal are given. In the case where the set of efficient solutions of the problem P* contains that of P, we also suggest how the difference between the sets of efficient solutions of the problems P* and P might be evaluated. Examples are given to illustrate our results.
W artykule rozważa się zadanie optymalizacji wektorowej P z ciągłymi i wypukłymi funkcjami celu na zwartym wypukłym zbiorze rozwiazań dopuszczalnych. Tworzymy nowe zadanie optymalizacji wektorowej P* poprzez dodanie funkcji celu do zadania P. Podano warunki konieczne i wystarczające do tego, by zbiory rozwiązań sprawnych obu zadań były równe. Dla przypadku, gdy zbiór rozwiązan sprawnych zadania P* zawiera odpowiedni zbiór dla P, zaproponowano także sposób oceny różnicy między tymi zbiorami rozwiązań sprawnych. Wyniki podane w artykule zostały zilustrowane przykładami.
Źródło:
Control and Cybernetics; 2002, 31, 4; 965-974
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cost-efficient synthesis of multiprocessor heterogeneous systems
Autorzy:
Deniziak, S.
Powiązania:
https://bibliotekanauki.pl/articles/970364.pdf
Data publikacji:
2004
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
rozproszony system komputerowy
HW/SW co-synthesis
distributed systems
SoC
Opis:
In this paper an algorithm for co-synthesis of distributed embedded systems is presented. The algorithm is based on iterative improvement heuristics, taking into consideration sophisticated modifications and possibilities of further improvements. Starting from the solution with the highest performance, architecture of the system is modified until it achieves the lowest cost. It has been observed that the algorithm presented has the capacity of getting out of the local minima. Experimental results showed high efficiency of the algorithm. Almost all results obtained with the help of the algorithm were significantly better than the results obtained with the help of Yen-Wolf algorithm presented in the literature.
Źródło:
Control and Cybernetics; 2004, 33, 2; 341-355
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nonessential objective functions in linear multiobjective optimization problems
Autorzy:
Malinowska, A. B.
Powiązania:
https://bibliotekanauki.pl/articles/970000.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
multiple criteria decision making
multiobjective (vector) optimization
efficient solutions
nonessential objectives
Opis:
In multiobjective (vector) optimization problems, among the given objective functions there exist some, which do not influence the set of efficient solutions. These objective functions are said to be nonessential. In this paper we present a new method to decide if a given linear objective function is nonessential or not.
Źródło:
Control and Cybernetics; 2006, 35, 4; 873-880
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An efficient SQL-based querying method to RDF schemata
Autorzy:
Falkowski, M.
Jędrzejek, Cz.
Powiązania:
https://bibliotekanauki.pl/articles/970821.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
semantic data
graph query
RDF
relational database
query rewriting
Opis:
Applications based on knowledge engineering require operations on semantic data. Modern systems have to deal with large data volumes and the challenge is to process and search these data effectively. One of the aspects of efficiency is the ability to query those data with respect to their semantics. In this area an RDF data model and a SPARQL query language gained the highest popularity and are de facto standards. The problem is that most data in modern systems are stored in relational databases and have no formal and precisely expressed semantics, although operations on those data are fast and scalable. Traditionally, in this area relational data are transformed to a form expected by reasoning and querying systems (usually RDF based). In this work a method of query rewriting is presented that translates a query to an RDF data structure (i.e. SPARQL query) to a SQL query executed by RDBMS. Transforming queries instead of data has many advantages and might lead to significant increase of data extraction efficiency.
Źródło:
Control and Cybernetics; 2009, 38, 1; 193-213
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An efficient genetic algorithm for the uncapacitated multiple allocation p-hub median problem
Autorzy:
Stanimirovic, Z.
Powiązania:
https://bibliotekanauki.pl/articles/970612.pdf
Data publikacji:
2008
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
p-hub problem
genetic algorithms
discrete location and assignment
Opis:
In this paper the Uncapacitated Multiple Allocation p-hub Median Problem (the UMApHMP) is considered. A new heuristic method based on a genetic algorithm approach (GA) for solving UMApHMP is proposed. The described GA uses binary representation of the solutions. Genetic operators which keep the feasibility of individuals in the population are designed and implemented. The mutation operator with frozen bits is used to increase the diversibility of the genetic material. The running time of the GA is improved by caching technique. Proposed GA approach is bench-marked on the well known CAB and AP data sets and compared with the existing methods for solving the UMApHMP. Computational results show that the GA quickly reaches all previously known optimal solutions, and also gives results on large scale AP instances (up to n=200, p=20) that were not considered in the literature so far.
Źródło:
Control and Cybernetics; 2008, 37, 3; 669-692
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An efficient provably secure certificateless aggregate signature applicable to mobile computation
Autorzy:
Xiong, H.
Wu, Q.
Chen, Z.
Powiązania:
https://bibliotekanauki.pl/articles/206221.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
message authentication
certificateless cryptography
aggregate signature
mobile computing
Opis:
An aggregate signature scheme allows a public algorithm to aggregate n signatures on n distinct messages from n signers into a single signature. By validating the single resulting signature, one can be convinced that the messages have been endorsed by all the signers. Certificateless aggregate signatures allow the signers to authenticate messages without suffering from the complex certificate management in the traditional public key cryptography or the key escrow problem in identity-based cryptography. In this paper, we present a new efficient certificateless aggregate signature scheme. Compared with up-to-date certificateless aggregate signatures, our scheme is equipped with a number of attracting features: (1) it is shown to be secure under the standard computational Diffie-Hellman assumption in the random oracle model; (2) the security is proven in the strongest security model so far; (3) the signers do not need to be synchronized; and (4) its performance is comparable to the most efficient up-to-date schemes. These features are desirable in a mobile networking and computing environment where the storage/ computation capacity of the end devices are limited, and due to the wireless connection and distributed feature, the computing devices are easy to be attacked and hard to be synchronized.
Źródło:
Control and Cybernetics; 2012, 41, 2; 373-391
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Necessary optimality conditions for robust nonsmooth multiobjective optimization problems
Autorzy:
Gadhi, Nazih Abderrazzak
Ohda, Mohamed
Powiązania:
https://bibliotekanauki.pl/articles/2183482.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
convexificator
directional constraint qualification
efficient solution
optimality conditions
robust multiobjective optimization
Opis:
This paper deals with a robust multiobjective optimization problem involving nonsmooth/nonconvex real-valued functions. Under an appropriate constraint qualification, we establish necessary optimality conditions for weakly robust efficient solutions of the considered problem. These optimality conditions are presented in terms of Karush-Kuhn-Tucker multipliers and convexificators of the related functions. Examples illustrating our findings are also given.
Źródło:
Control and Cybernetics; 2022, 51, 3; 289--302
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Order-Lipschitzian properties of multifunctions with applications to stability of efficient points
Autorzy:
Bednarczuk, E. M.
Powiązania:
https://bibliotekanauki.pl/articles/970514.pdf
Data publikacji:
2003
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
optymalizacja wektorowa
stabilność
vector optimization
stability
Lipschitz continuity of solutions
Opis:
We define order-Lipschitzian properties of multifunctions and we investigate local upper order-lipschitzness and order-calmness of efficient points of a set depending upon a parameter.
Źródło:
Control and Cybernetics; 2003, 32, 3; 491-502
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fuzzy dynamic programming: interpolative reasoning for an efficient derivation of optimal control policies
Autorzy:
Kacprzyk, J.
Powiązania:
https://bibliotekanauki.pl/articles/205739.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
multistage fuzzy control
fuzzy dynamic programming
fuzzy system under control
interpolative reasoning
Opis:
We consider multistage optimal control of a fuzzy dynamic system under fuzzy constraints on controls and fuzzy goals on states in the setting of Bellman and Zadeh (1970) and Kacprzyk (1983, 1997). First, we present the solution by dynamic programming chich is a standard techniques in the class of problems considered. We indicato its limitations, mainly related to its inherent curse of dimensionality. We propose to replace the source problem by its auxiliary counterpart with a small number of reference fuzzy states and reference fuzzy controls, solve it by dynamic programming to obtain optimal reference control policies relating optimal reference fuzzy controls to reference fuzzy states. Then, we show the use of an interpolative reasoning approach to derive optimal fuzzy controls, not necessarily reference ones, for current fuzzy states, not necessarily reference ones.
Źródło:
Control and Cybernetics; 2013, 42, 1; 63-84
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the quasi-efficient frontier of the set of optimal portfolios under hybrid uncertainty with short sales allowed
Autorzy:
Rogonov, Stepan A.
Soldatenko, Ilia S.
Yazenin, Alexander V.
Powiązania:
https://bibliotekanauki.pl/articles/31342749.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
portfolio selection model
hybrid uncertainty
possibility
necessity
quasi-efficient solutions
minimum risk portfolio frontier
fuzzy random variable
Opis:
The paper describes the methods for constructing a quasi-efficient frontier of minimum risk portfolio under conditions of hybrid uncertainty with allowed short sales. Investor’s acceptable level of expected return is defined in crisp and fuzzy forms. Obtained results are illustrated on a model example. The dependence of the quasi-efficient frontier on the value of α-level is investigated.
Źródło:
Control and Cybernetics; 2022, 51, 4; 445-466
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Second-order necessary conditions of the Kuhn-Tucker type in multiobjective programming problems
Autorzy:
Aghezzaf, B.
Powiązania:
https://bibliotekanauki.pl/articles/970055.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
programowanie obiektowe
efficient solutions
multiobjective programming
second-order constraint qualification
second-order necessary conditions
Opis:
In this paper, we are concerned with a multiobjective programming problem with inequality constraints. We develop second-order necessary condition of the Kuhn-Tucker type for effciency and prove that the condition holds under a. constraint qualification. Moreover, we give some conditions which ensure that the constraint qua,lifica.tion holds.
Źródło:
Control and Cybernetics; 1999, 28, 2; 213-224
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cost-efficient project management based on critical chain method with partial availability of resources
Autorzy:
Pawiński, G.
Sapiecha, K.
Powiązania:
https://bibliotekanauki.pl/articles/205579.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
project management and scheduling
resource allocation
resource constraints
metaheuristic algorithms
parallel processing
Opis:
Cost-efficient project management based on Critical Chain Method (CCPM) is investigated in this paper. This is a variant of the resource-constrained project scheduling problem (RCPSP) when resources are only partially available and a deadline is given, but the cost of the project should be minimized. RCPSP is a well- known NP hard problem but originally it does not take into consideration the initial resource workload. A metaheuristic algorithm driven by a metric of a gain was adapted to solve the problem when applied to CCPM. Refinement methods enhancing the quality of the results are developed. The improvement expands the search space by inserting the task in place of an already allocated task, if a better allocation can be found for it. The increase of computation time is reduced by distributed calculations. The computational experiments showed significant efficiency of the approach, in comparison with the greedy methods and with genetic algorithm, as well as high reduction of time needed to obtain the results.
Źródło:
Control and Cybernetics; 2014, 43, 1; 95-109
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Model–based energy efficient global path planning for a four–wheeled mobile robot
Autorzy:
Jaroszek, P.
Trojnacki, M.
Powiązania:
https://bibliotekanauki.pl/articles/206564.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
four-wheeled mobile robot
global path planning
robot dynamics model
heuristic algorithm
energy efficiency
Opis:
This paper concerns an energy efficient global path planning algorithm for a four-wheeled mobile robot (4WMR). First, the appropriate graph search methods for robot path planning are described. The A* heuristic algorithm is chosen to find an optimal path on a 2D tile-decomposed map. Various criteria of optimization in path planning, like mobility, distance, or energy are reviewed. The adequate terrain representation is introduced. Each cell in the map includes information about ground height and type. Tire-ground interface for every terrain type is characterized by coefficients of friction and rolling resistance. The goal of the elaborated algorithm is to find an energy minimizing route for the given environment, based on the robot dynamics, its motor characteristics, and power supply constraints. The cost is introduced as a function of electrical energy consumption of each motor and other robot devices. A simulation study was performed in order to investigate the power consumption level for diverse terrain. Two 1600 m2 test maps, representing field and urban environments, were decomposed into 20x20 equal-sized square-shaped elements. Several simulation experiments have been carried out to highlight the differences between energy consumption of the classic shortest path approach, where cost function is represented as the path length, and the energy efficient planning method, where cost is related to electrical energy consumed during robot motion.
Źródło:
Control and Cybernetics; 2014, 43, 2; 337-363
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient spectral method of identification of linear Boolean function
Autorzy:
Porwik, P.
Powiązania:
https://bibliotekanauki.pl/articles/970438.pdf
Data publikacji:
2004
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
linear Boolean function
Walsh coefficients
coefficients distribution
incompletely defined Boolean functions
współczynnik Walsha
rozkład współczynników
niekompletnie zdefiniowana funkcja Boole'a
liniowa funkcja Boole'a
Opis:
This paper discusses a problem of recognition of the Boolean function's linearity. The article describes the spectral method of analysis of incompletely specified Boolean functions using the Walsh Transform. The linearity and nonlinearity play an important role in design of digital circuits. The analysis of the spectral coefficients' distribution allows to determine the various combinatorial properties of the Boolean functions: redundancy, monotonicity, self-duality, correcting capability, etc. which seems to be more difficult to obtain by means of other methods. In particular, the distribution of spectral coefficients allows us to determine whether Boolean function is linear. The method described in the paper can be easily used in investigations of large Boolean functions (of many variables), what seems to be very attractive for modern digital technologies. Experimental results demonstrate the efficiency of the approach.
Źródło:
Control and Cybernetics; 2004, 33, 4; 663-678
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 19

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