Gotowe bibliografie tematyczne / Local search / Artykuły w czasopismach

Artykuły w czasopismach na temat „Local search”

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Local search.
Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 22 czerwca 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Local search”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

HASEGAWA, Manabu. "Potentially Local Search in Local Search Heuristics". Proceedings of The Computational Mechanics Conference 2004.17 (2004): 403–4. http://dx.doi.org/10.1299/jsmecmd.2004.17.403.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Ishtaiwi, Abdelraouf, Ghassan Issa, Wael Hadi i Nawaf Ali. "Weight Resets in Local Search for SAT". International Journal of Machine Learning and Computing 9, nr 6 (grudzień 2019): 874–79. http://dx.doi.org/10.18178/ijmlc.2019.9.6.886.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Verhoeven, M. G. A., i E. H. L. Aarts. "Parallel local search". Journal of Heuristics 1, nr 1 (wrzesień 1995): 43–65. http://dx.doi.org/10.1007/bf02430365.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Lancia, Giuseppe, Franca Rinaldi i Paolo Serafini. "Local search inequalities". Discrete Optimization 16 (maj 2015): 76–89. http://dx.doi.org/10.1016/j.disopt.2015.02.003.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Choi, Changkyu, i Ju-Jang Lee. "Chaotic local search algorithm". Artificial Life and Robotics 2, nr 1 (marzec 1998): 41–47. http://dx.doi.org/10.1007/bf02471151.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Vaessens, R. J. M., E. H. L. Aarts i J. K. Lenstra. "A local search template". Computers & Operations Research 25, nr 11 (listopad 1998): 969–79. http://dx.doi.org/10.1016/s0305-0548(97)00093-2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Oliveira, Leonardo D., Fernando Ciriaco, Taufik Abrão i Paul Jean E. Jeszensky. "Local search multiuser detection". AEU - International Journal of Electronics and Communications 63, nr 4 (kwiecień 2009): 259–70. http://dx.doi.org/10.1016/j.aeue.2008.01.009.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Whitley, Darrell, i Jonathan Rowe. "Subthreshold-seeking local search". Theoretical Computer Science 361, nr 1 (sierpień 2006): 2–17. http://dx.doi.org/10.1016/j.tcs.2006.04.008.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Dubois-Lacoste, Jérémie, Manuel López-Ibáñez i Thomas Stützle. "Anytime Pareto local search". European Journal of Operational Research 243, nr 2 (czerwiec 2015): 369–85. http://dx.doi.org/10.1016/j.ejor.2014.10.062.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Anderson, E. J. "Mechanisms for local search". European Journal of Operational Research 88, nr 1 (styczeń 1996): 139–51. http://dx.doi.org/10.1016/0377-2217(94)00164-2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
11

Pirlot, Marc. "General local search methods". European Journal of Operational Research 92, nr 3 (sierpień 1996): 493–511. http://dx.doi.org/10.1016/0377-2217(96)00007-0.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
12

Porumbel, Daniel, i Jin-Kao Hao. "Distance-guided local search". Journal of Heuristics 26, nr 5 (26.05.2020): 711–41. http://dx.doi.org/10.1007/s10732-020-09446-w.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
13

Tricoire, Fabien. "Multi-directional local search". Computers & Operations Research 39, nr 12 (grudzień 2012): 3089–101. http://dx.doi.org/10.1016/j.cor.2012.03.010.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
14

Hitotsuyanagi, Yasuhiro, Yoshihiko Wakamatsu, Yusuke Nojima i Hisao Ishibuchi. "Selection of Initial Solutions for Local Search in Multiobjective Genetic Local Search". Transactions of the Institute of Systems, Control and Information Engineers 23, nr 8 (2010): 178–87. http://dx.doi.org/10.5687/iscie.23.178.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
15

Garnier, Josselin, i Leila Kallel. "Efficiency of Local Search with Multiple Local Optima". SIAM Journal on Discrete Mathematics 15, nr 1 (styczeń 2001): 122–41. http://dx.doi.org/10.1137/s0895480199355225.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
16

Schaerf, Andrea, Marco Cadoli i Maurizio Lenzerini. "LOCAL++: A C++ framework for local search algorithms". Software: Practice and Experience 30, nr 3 (marzec 2000): 233–57. http://dx.doi.org/10.1002/(sici)1097-024x(200003)30:3<233::aid-spe297>3.0.co;2-k.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
17

Altschul, Stephen F., Warren Gish, Webb Miller, Eugene W. Myers i David J. Lipman. "Basic local alignment search tool". Journal of Molecular Biology 215, nr 3 (październik 1990): 403–10. http://dx.doi.org/10.1016/s0022-2836(05)80360-2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
18

Halim, Felix, Panagiotis Karras i Roland Yap. "Local Search in Histogram Construction". Proceedings of the AAAI Conference on Artificial Intelligence 24, nr 1 (5.07.2010): 1680–85. http://dx.doi.org/10.1609/aaai.v24i1.7713.

Pełny tekst źródła
Streszczenie:
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number of boundaries for the segments so as to optimize an objective error function defined over those segments. Although this optimization problem can be solved in polynomial time, the algorithm which achieves the minimum error does not scale well, hence it is not practical for applications with massive data sets. There is considerable research with numerous approximation and heuristic algorithms. Still, none of those approaches has resolved the quality-efficiency tradeoff in a satisfactory manner. In (Halim, Karras, and Yap 2009), we obtain near linear time algorithms which achieve both the desired scalability and near-optimal quality, thus dominating earlier approaches. In this paper, we show how two ideas from artificial intelligence, an efficient local search and recombination of multiple solutions reminiscent of genetic algorithms, are combined in a novel way to obtain state of the art histogram construction algorithms.
Style APA, Harvard, Vancouver, ISO itp.
19

Gutiérrez-Naranjo, Miguel A., i Mario J. Pérez-Jiménez. "Local Search with P Systems". International Journal of Natural Computing Research 2, nr 2 (kwiecień 2011): 47–55. http://dx.doi.org/10.4018/jncr.2011040104.

Pełny tekst źródła
Streszczenie:
Local search is currently one of the most used methods for finding solutions in real-life problems. It is usually considered when the research is interested in the final solution of the problem instead of the how the solution is reached. In this paper, the authors present an implementation of local search with Membrane Computing techniques applied to the N-queens problem as a case study. A CLIPS program inspired in the Membrane Computing design has been implemented and several experiments have been performed. The obtained results show better average times than those obtained with other Membrane Computing implementations that solve the N-queens problem.
Style APA, Harvard, Vancouver, ISO itp.
20

Orman, A., E. Aarts i J. K. Lenstra. "Local Search in Combinatorial Optimisation." Journal of the Operational Research Society 50, nr 2 (luty 1999): 191. http://dx.doi.org/10.2307/3010571.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
21

Kadam, Tanmay, Nikhil Saxena, Akash Kosambia i Anita Lahane. "Local Search –The Perfect Guide". International Journal of Engineering Trends and Technology 9, nr 13 (25.03.2014): 652–57. http://dx.doi.org/10.14445/22315381/ijett-v9p323.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
22

Musliu, Nysret, Andrea Schaerf i Wolfgang Slany. "Local search for shift design". European Journal of Operational Research 153, nr 1 (luty 2004): 51–64. http://dx.doi.org/10.1016/s0377-2217(03)00098-5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
23

Laszlo, Michael, i Sumitra Mukherjee. "Iterated local search for microaggregation". Journal of Systems and Software 100 (luty 2015): 15–26. http://dx.doi.org/10.1016/j.jss.2014.10.012.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
24

Aarts, Emile H. L., i Peter J. M. van Laarhoven. "Local search in coding theory". Discrete Mathematics 106-107 (wrzesień 1992): 11–18. http://dx.doi.org/10.1016/0012-365x(92)90524-j.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
25

Rödl, V., i C. Tovey. "Multiple optima in local search". Journal of Algorithms 8, nr 2 (czerwiec 1987): 250–59. http://dx.doi.org/10.1016/0196-6774(87)90041-1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
26

Johnson, David S., Christos H. Papadimitriou i Mihalis Yannakakis. "How easy is local search?" Journal of Computer and System Sciences 37, nr 1 (sierpień 1988): 79–100. http://dx.doi.org/10.1016/0022-0000(88)90046-3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
27

Jaszkiewicz, Andrzej. "Many-Objective Pareto Local Search". European Journal of Operational Research 271, nr 3 (grudzień 2018): 1001–13. http://dx.doi.org/10.1016/j.ejor.2018.06.009.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
28

Verhoeven, Yves F. "Enhanced algorithms for Local Search". Information Processing Letters 97, nr 5 (marzec 2006): 171–76. http://dx.doi.org/10.1016/j.ipl.2005.11.004.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
29

Barbucha, Dariusz. "Agent-based guided local search". Expert Systems with Applications 39, nr 15 (listopad 2012): 12032–45. http://dx.doi.org/10.1016/j.eswa.2012.03.074.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
30

Van Hentenryck, Pascal, i Laurent Michel. "Control Abstractions for Local Search". Constraints 10, nr 2 (kwiecień 2005): 137–57. http://dx.doi.org/10.1007/s10601-005-0553-x.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
31

Grégoire, Éric, Bertrand Mazure i Cédric Piette. "Local-search Extraction of MUSes". Constraints 12, nr 3 (9.06.2007): 325–44. http://dx.doi.org/10.1007/s10601-007-9019-7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
32

Guo, Zhaolu, Wensheng Zhang i Shenwen Wang. "Improved gravitational search algorithm based on chaotic local search". International Journal of Bio-Inspired Computation 17, nr 3 (2021): 154. http://dx.doi.org/10.1504/ijbic.2021.114873.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
33

Guo, Zhaolu, Wensheng Zhang i Shenwen Wang. "Improved gravitational search algorithm based on chaotic local search". International Journal of Bio-Inspired Computation 17, nr 3 (2021): 154. http://dx.doi.org/10.1504/ijbic.2021.10037528.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
34

Yan, Shaoqiang, Ping Yang, Donglin Zhu, Wanli Zheng i Fengxuan Wu. "Improved Sparrow Search Algorithm Based on Iterative Local Search". Computational Intelligence and Neuroscience 2021 (15.12.2021): 1–31. http://dx.doi.org/10.1155/2021/6860503.

Pełny tekst źródła
Streszczenie:
This paper solves the shortcomings of sparrow search algorithm in poor utilization to the current individual and lack of effective search, improves its search performance, achieves good results on 23 basic benchmark functions and CEC 2017, and effectively improves the problem that the algorithm falls into local optimal solution and has low search accuracy. This paper proposes an improved sparrow search algorithm based on iterative local search (ISSA). In the global search phase of the followers, the variable helix factor is introduced, which makes full use of the individual’s opposite solution about the origin, reduces the number of individuals beyond the boundary, and ensures the algorithm has a detailed and flexible search ability. In the local search phase of the followers, an improved iterative local search strategy is adopted to increase the search accuracy and prevent the omission of the optimal solution. By adding the dimension by dimension lens learning strategy to scouters, the search range is more flexible and helps jump out of the local optimal solution by changing the focusing ability of the lens and the dynamic boundary of each dimension. Finally, the boundary control is improved to effectively utilize the individuals beyond the boundary while retaining the randomness of the individuals. The ISSA is compared with PSO, SCA, GWO, WOA, MWOA, SSA, BSSA, CSSA, and LSSA on 23 basic functions to verify the optimization performance of the algorithm. In addition, in order to further verify the optimization performance of the algorithm when the optimal solution is not 0, the above algorithms are compared in CEC 2017 test function. The simulation results show that the ISSA has good universality. Finally, this paper applies ISSA to PID parameter tuning and robot path planning, and the results show that the algorithm has good practicability and effect.
Style APA, Harvard, Vancouver, ISO itp.
35

Zhang, Maoqing, Hui Wang, Zhihua Cui i Jinjun Chen. "Hybrid multi-objective cuckoo search with dynamical local search". Memetic Computing 10, nr 2 (4.07.2017): 199–208. http://dx.doi.org/10.1007/s12293-017-0237-2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
36

Wu, Jun, Chu-Min Li, Lu Jiang, Junping Zhou i Minghao Yin. "Local search for diversified Top-k clique search problem". Computers & Operations Research 116 (kwiecień 2020): 104867. http://dx.doi.org/10.1016/j.cor.2019.104867.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
37

Gyllenberg, M., T. Koski, T. Lund i O. Nevalainen. "Clustering by Adaptive Local Search with Multiple Search Operators". Pattern Analysis & Applications 3, nr 4 (1.12.2000): 348–57. http://dx.doi.org/10.1007/s100440070006.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
38

Queiroz dos Santos, João Paulo, Jorge Dantas de Melo, Adrião Dória Duarte Neto i Daniel Aloise. "Reactive Search strategies using Reinforcement Learning, local search algorithms and Variable Neighborhood Search". Expert Systems with Applications 41, nr 10 (sierpień 2014): 4939–49. http://dx.doi.org/10.1016/j.eswa.2014.01.040.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
39

Seppälä, Jane, i Timo Olavi Vuori. "Machine Learning in Strategic Search: Alleviating and Aggravating Local Search". Academy of Management Proceedings 2021, nr 1 (sierpień 2021): 14980. http://dx.doi.org/10.5465/ambpp.2021.14980abstract.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
40

Wang, Jie, i Hongwen Li. "Particle Swarm Optimization with Enhanced Global Search and Local Search". Journal of Intelligent Systems 26, nr 3 (26.07.2017): 421–32. http://dx.doi.org/10.1515/jisys-2015-0153.

Pełny tekst źródła
Streszczenie:
AbstractIn order to mitigate the problems of premature convergence and low search accuracy that exist in traditional particle swarm optimization (PSO), this paper presents PSO with enhanced global search and local search (EGLPSO). In EGLPSO, most of the particles would be concentrated in global search at the beginning. Along with the iteration, the particles would slowly focus on local search. A new updating strategy would be used for global search, and a partial mutation strategy is applied to the leader particle of local search for a better position. During each iteration, the best particle of global search would exchange information with some particles of local search. EGLPSO is tested on a set of 12 benchmark functions, and it is also compared with other four PSO variants and another six well-known PSO variants. The experimental results showed that EGLPSO can greatly improve the performance of traditional PSO in terms of search accuracy, search efficiency, and global optimality.
Style APA, Harvard, Vancouver, ISO itp.
41

Li, Chunting, Zigang Lian i Tipeng Zhang. "An Optimized Bat Algorithm Combining Local Search and Global Search". IOP Conference Series: Earth and Environmental Science 571 (26.11.2020): 012018. http://dx.doi.org/10.1088/1755-1315/571/1/012018.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
42

Jackson, Warren G., Ender Özcan i Robert I. John. "Move acceptance in local search metaheuristics for cross-domain search". Expert Systems with Applications 109 (listopad 2018): 131–51. http://dx.doi.org/10.1016/j.eswa.2018.05.006.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
43

Desai, Hemang, i Birajkumar V. Patel. "Search Engine Optimization Using Local Language". International Journal of Computer Sciences and Engineering 6, nr 7 (31.07.2018): 1238–39. http://dx.doi.org/10.26438/ijcse/v6i7.12381239.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
44

Frank, J., P. Cheeseman i J. Stutz. "When Gravity Fails: Local Search Topology". Journal of Artificial Intelligence Research 7 (1.12.1997): 249–81. http://dx.doi.org/10.1613/jair.445.

Pełny tekst źródła
Streszczenie:
Local search algorithms for combinatorial search problems frequently encounter a sequence of states in which it is impossible to improve the value of the objective function; moves through these regions, called plateau moves, dominate the time spent in local search. We analyze and characterize plateaus for three different classes of randomly generated Boolean Satisfiability problems. We identify several interesting features of plateaus that impact the performance of local search algorithms. We show that local minima tend to be small but occasionally may be very large. We also show that local minima can be escaped without unsatisfying a large number of clauses, but that systematically searching for an escape route may be computationally expensive if the local minimum is large. We show that plateaus with exits, called benches, tend to be much larger than minima, and that some benches have very few exit states which local search can use to escape. We show that the solutions (i.e., global minima) of randomly generated problem instances form clusters, which behave similarly to local minima. We revisit several enhancements of local search algorithms and explain their performance in light of our results. Finally we discuss strategies for creating the next generation of local search algorithms.
Style APA, Harvard, Vancouver, ISO itp.
45

Mouhoub, Malek. "Stochastic local search for incremental SAT". International Journal of Knowledge-based and Intelligent Engineering Systems 9, nr 3 (13.09.2005): 191–95. http://dx.doi.org/10.3233/kes-2005-9303.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
46

Gaspers, Serge, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh i Stefan Szeider. "Don't Be Strict in Local Search!" Proceedings of the AAAI Conference on Artificial Intelligence 26, nr 1 (20.09.2021): 486–92. http://dx.doi.org/10.1609/aaai.v26i1.8128.

Pełny tekst źródła
Streszczenie:
Local Search is one of the fundamental approaches to combinatorial optimization and it is used throughout AI. Several local search algorithms are based on searching the k-exchange neighborhood. This is the set of solutions that can be obtained from the current solution by exchanging at most k elements. As a rule of thumb, the larger k is, the better are the chances of finding an improved solution. However, for inputs of size n, a naive brute-force search of the k-exchange neighborhood requires n(O(k)) time, which is not practical even for very small values of k. Fellows et al. (IJCAI 2009) studied whether this brute-force search is avoidable and gave positive and negative answers for several combinatorial problems. They used the notion of local search in a strict sense. That is, an improved solution needs to be found in the k-exchange neighborhood even if a global optimum can be found efficiently. In this paper we consider a natural relaxation of local search, called permissive local search (Marx and Schlotter, IWPEC 2009) and investigate whether it enhances the domain of tractable inputs. We exemplify this approach on a fundamental combinatorial problem, Vertex Cover. More precisely, we show that for a class of inputs, finding an optimum is hard, strict local search is hard, but permissive local search is tractable. We carry out this investigation in the framework of parameterized complexity.
Style APA, Harvard, Vancouver, ISO itp.
47

Liu, Defeng, Matteo Fischetti i Andrea Lodi. "Learning to Search in Local Branching". Proceedings of the AAAI Conference on Artificial Intelligence 36, nr 4 (28.06.2022): 3796–803. http://dx.doi.org/10.1609/aaai.v36i4.20294.

Pełny tekst źródła
Streszczenie:
Finding high-quality solutions to mixed-integer linear programming problems (MILPs) is of great importance for many practical applications. In this respect, the refinement heuristic local branching (LB) has been proposed to produce improving solutions and has been highly influential for the development of local search methods in MILP. The algorithm iteratively explores a sequence of solution neighborhoods defined by the so-called local branching constraint, namely, a linear inequality limiting the distance from a reference solution. For a LB algorithm, the choice of the neighborhood size is critical to performance. Although it was initialized by a conservative value in the original LB scheme, our new observation is that the "best" size is strongly dependent on the particular MILP instance. In this work, we investigate the relation between the size of the search neighborhood and the behavior of the underlying LB algorithm, and we devise a leaning-based framework for guiding the neighborhood search of the LB heuristic. The framework consists of a two-phase strategy. For the first phase, a scaled regression model is trained to predict the size of the LB neighborhood at the first iteration through a regression task. In the second phase, we leverage reinforcement learning and devise a reinforced neighborhood search strategy to dynamically adapt the size at the subsequent iterations. We computationally show that the neighborhood size can indeed be learned, leading to improved performances and that the overall algorithm generalizes well both with respect to the instance size and, remarkably, across instances.
Style APA, Harvard, Vancouver, ISO itp.
48

Jabba, Ayad. "Rule Induction with Iterated Local Search". International Journal of Intelligent Engineering and Systems 14, nr 4 (31.08.2021): 289–98. http://dx.doi.org/10.22266/ijies2021.0831.26.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
49

Moreno-Espino, Mailyn, i Alejandro Rosete-Suárez. "Proactive local search based on FDC". DYNA 81, nr 184 (24.04.2014): 201. http://dx.doi.org/10.15446/dyna.v81n184.37303.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
50

He, Jun, Pierre Flener i Justin Pearson. "An automaton Constraint for Local Search". Fundamenta Informaticae 107, nr 2-3 (2011): 223–48. http://dx.doi.org/10.3233/fi-2011-401.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany bibliografiami na temat „Local search” dla innych typów źródeł:
Rozprawy doktorskie Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii