Zaloguj się

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

Artykuły w czasopismach na temat „Linear search”

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Linear search.

Autor: Grafiati

Data publikacji: 25 maja 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 „Linear 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

Hohzaki, Ryusuke. "A SEARCH GAME TAKING ACCOUNT OF LINEAR EFFECTS AND LINEAR CONSTRAINTS OF SEARCHING RESOURCE". Journal of the Operations Research Society of Japan 55, nr 1 (2012): 1–22. http://dx.doi.org/10.15807/jorsj.55.1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Mäkinen, Erkki. "On linear search heuristics". Information Processing Letters 29, nr 1 (wrzesień 1988): 35–36. http://dx.doi.org/10.1016/0020-0190(88)90129-9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Hester, J. H., i D. S. Hirschberg. "Self-organizing linear search". ACM Computing Surveys 17, nr 3 (wrzesień 1985): 295–311. http://dx.doi.org/10.1145/5505.5507.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Arora, Nitin, Garima Bhasin i Neha Sharma. "Two way Linear Search Algorithm". International Journal of Computer Applications 107, nr 21 (18.12.2014): 6–8. http://dx.doi.org/10.5120/19137-9622.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Limoncelli, Thomas A. "10 optimizations on linear search". Communications of the ACM 59, nr 9 (24.08.2016): 44–48. http://dx.doi.org/10.1145/2980976.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Limoncelli, Thomas A. "10 Optimizations on Linear Search". Queue 14, nr 4 (sierpień 2016): 20–33. http://dx.doi.org/10.1145/2984629.2984631.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Korf, Richard E. "Linear-space best-first search". Artificial Intelligence 62, nr 1 (lipiec 1993): 41–78. http://dx.doi.org/10.1016/0004-3702(93)90045-d.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Foley, R. D., T. P. Hill i M. C. Spruill. "Linear search with bounded resources". Naval Research Logistics 38, nr 4 (sierpień 1991): 555–65. http://dx.doi.org/10.1002/1520-6750(199108)38:4<555::aid-nav3220380408>3.0.co;2-8.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Kumari, Anchala. "Linear Search Versus Binary Search:A Statistical Comparison For Binomial Inputs". International Journal of Computer Science, Engineering and Applications 2, nr 2 (30.04.2012): 29–39. http://dx.doi.org/10.5121/ijcsea.2012.2203.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Balkhi, Zaid T. "THE GENERALIZED LINEAR SEARCH PROBLEM, EXISTENCE OF OPTIMAL SEARCH PATHS". Journal of the Operations Research Society of Japan 30, nr 4 (1987): 399–421. http://dx.doi.org/10.15807/jorsj.30.399.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Manski, Charles F. "Optimal Search Profiling with Linear Deterrence". American Economic Review 95, nr 2 (1.04.2005): 122–26. http://dx.doi.org/10.1257/000282805774669817.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Heydari, Javad, Ali Tajer i H. Vincent Poor. "Quickest Linear Search over Correlated Sequences". IEEE Transactions on Information Theory 62, nr 10 (październik 2016): 5786–808. http://dx.doi.org/10.1109/tit.2016.2593772.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

Korytowski, A. "Inner search methods for linear programming". Applicationes Mathematicae 20, nr 2 (1988): 307–27. http://dx.doi.org/10.4064/am-20-2-307-327.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

Gorbunov, Dmitry S., i Viacheslav A. Ilyin. "Stoponium search at photon linear collider". Journal of High Energy Physics 2000, nr 11 (6.11.2000): 011. http://dx.doi.org/10.1088/1126-6708/2000/11/011.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

Saha, Subir, Mridul K.Bhaumik i Supratim Das. "A New Modified Linear Search Algorithm". International Journal of Mathematics Trends and Technology 65, nr 12 (25.12.2019): 148–52. http://dx.doi.org/10.14445/22315373/ijmtt-v65i12p516.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

Beck, Anatole, i Micah Beck. "The linear search problem rides again". Israel Journal of Mathematics 53, nr 3 (grudzień 1986): 365–72. http://dx.doi.org/10.1007/bf02786568.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Rodler, Patrick. "Linear-Space Best-First Diagnosis Search". Proceedings of the International Symposium on Combinatorial Search 12, nr 1 (21.07.2021): 188–90. http://dx.doi.org/10.1609/socs.v12i1.18579.

Pełny tekst źródła

Streszczenie:

Various model-based diagnosis scenarios require the computation of the most preferred fault explanations. Existing algorithms that are sound (i.e., output only actual fault explanations) and complete (i.e., can return all explanations), however, require exponential space to achieve this task. As a remedy, to enable successful diagnosis on memory-restricted devices and for memory-intensive problem cases, we propose RBF-HS, a diagnostic search based on Korf’s seminal RBFS algorithm. RBF-HS can enumerate an arbitrary ﬁxed number of fault explanations in best-ﬁrst order within linear space bounds, without sacriﬁcing the desirable soundness or completeness properties. Evaluations using real-world diagnosis cases show that RBF-HS, when used to compute minimum-cardinality fault explanations, in most cases saves substantial space (up to 98 %) while requiring only reasonably more or even less time than Reiter’s HS-Tree, one of the most widely used diagnostic algorithms with the same properties.

Style APA, Harvard, Vancouver, ISO itp.

18

Nickels, W., W. Rödder, L. Xu i H. J. Zimmermann. "Intelligent gradient search in linear programming". European Journal of Operational Research 22, nr 3 (grudzień 1985): 293–303. http://dx.doi.org/10.1016/0377-2217(85)90248-6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

Zhang, Weixiong, i Richard E. Korf. "Performance of linear-space search algorithms". Artificial Intelligence 79, nr 2 (grudzień 1995): 241–92. http://dx.doi.org/10.1016/0004-3702(94)00047-6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

Baston, Vic, i Anatole Beck. "Generalizations in the linear search problem". Israel Journal of Mathematics 90, nr 1-3 (październik 1995): 301–23. http://dx.doi.org/10.1007/bf02783218.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

Mejia, Carolina. "Linear secret sharing and the automatic search of linear rank inequalities". Applied Mathematical Sciences 9 (2015): 5305–24. http://dx.doi.org/10.12988/ams.2015.57478.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

Beck, Anatole, i Micah Beck. "The Revenge of the Linear Search Problem". SIAM Journal on Control and Optimization 30, nr 1 (styczeń 1992): 112–22. http://dx.doi.org/10.1137/0330008.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

Gonzaga, Clovis C. "Search directions for interior linear-programming methods". Algorithmica 6, nr 1-6 (czerwiec 1991): 153–81. http://dx.doi.org/10.1007/bf01759039.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Korf, Richard E. "Linear-time disk-based implicit graph search". Journal of the ACM 55, nr 6 (grudzień 2008): 1–40. http://dx.doi.org/10.1145/1455248.1455250.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

Koehler, Gary J. "Linear Discriminant Functions Determined by Genetic Search". ORSA Journal on Computing 3, nr 4 (listopad 1991): 345–57. http://dx.doi.org/10.1287/ijoc.3.4.345.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

El-Rayes, A. B., Abd El-Moneim A. Mohamed i Hamdy M. Abou Gabal. "LINEAR SEARCH FOR A BROWNIAN TARGET MOTION". Acta Mathematica Scientia 23, nr 3 (lipiec 2003): 321–27. http://dx.doi.org/10.1016/s0252-9602(17)30338-7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Greenberg, Shlomo, i Daniel Kogan. "Linear search applied to global motion estimation". Multimedia Systems 12, nr 6 (22.11.2006): 493–504. http://dx.doi.org/10.1007/s00530-006-0069-2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Németh, Károly, i Gustavo E. Scuseria. "Linear scaling density matrix search based onsignmatrices". Journal of Chemical Physics 113, nr 15 (15.10.2000): 6035–41. http://dx.doi.org/10.1063/1.1308546.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Hatem, Matthew, Roni Stern i Wheeler Ruml. "Bounded Suboptimal Heuristic Search in Linear Space". Proceedings of the International Symposium on Combinatorial Search 4, nr 1 (20.08.2021): 98–104. http://dx.doi.org/10.1609/socs.v4i1.18297.

Pełny tekst źródła

Streszczenie:

It is commonly appreciated that solving search problems optimally can overrun time and memory constraints. Bounded suboptimal search algorithms trade increased solution cost for reduced solving time and memory consumption. However, even suboptimal search can overrun memory on large problems. The conventional approach to this problem is to combine a weighted admissible heuristic with an optimal linear space algorithm, resulting in algorithms such as Weighted IDA* (wIDA*). However, wIDA* does not exploit distance-to-go estimates or inadmissible heuristics, which have recently been shown to be helpful for suboptimal search. In this paper, we present a linear space analogue of Explicit Estimation Search (EES), a recent algorithm specifically designed for bounded suboptimal search. We call our method Iterative Deepening EES (IDEES). In an empirical evaluation, we show that IDEES dramatically outperforms wIDA* on domains with non-uniform edge costs and can scale to problems that are out of reach for the original EES.

Style APA, Harvard, Vancouver, ISO itp.

30

Krivoi, S. L., i S. G. Raksha. "Search for invariant linear relationships in programs". Cybernetics 20, nr 6 (1985): 796–803. http://dx.doi.org/10.1007/bf01072165.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Amin, Gholam R., i Ali Emrouznejad. "Optimizing search engines results using linear programming". Expert Systems with Applications 38, nr 9 (wrzesień 2011): 11534–37. http://dx.doi.org/10.1016/j.eswa.2011.03.030.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

P.Parmar, Vimal, i CK Kumbharana. "Comparing Linear Search and Binary Search Algorithms to Search an Element from a Linear List Implemented through Static Array, Dynamic Array and Linked List". International Journal of Computer Applications 121, nr 3 (18.07.2015): 13–17. http://dx.doi.org/10.5120/21519-4495.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

Hatem, Matthew, i Wheeler Ruml. "Bounded Suboptimal Search in Linear Space: New Results". Proceedings of the International Symposium on Combinatorial Search 5, nr 1 (1.09.2021): 89–96. http://dx.doi.org/10.1609/socs.v5i1.18327.

Pełny tekst źródła

Streszczenie:

Bounded suboptimal search algorithms are usually faster than optimal ones, but they can still run out of memory on large problems. This paper makes three contributions. First, we show how solution length estimates, used by the current state-of-the-art linear-space bounded suboptimal search algorithm Iterative Deepening EES, can be used to improve unbounded-space suboptimal search. Second, we convert one of these improved algorithms into a linear-space variant called Iterative Deepening A* epsilon, resulting in a new state of the art in linear-space bounded suboptimal search. Third, we show how Recursive Best-First Search can be used to create additional linear-space variants that have more stable performance. Taken together, these results significantly expand our armamentarium of bounded suboptimal search algorithms.

Style APA, Harvard, Vancouver, ISO itp.

34

Vighneshvel, T., i S. P. Arun. "Does linear separability really matter? Complex visual search is explained by simple search". Journal of Vision 13, nr 11 (12.09.2013): 10. http://dx.doi.org/10.1167/13.11.10.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

Ahmed, Haffane, i Hasni Abdelhafid. "Cuckoo search optimization for linear antenna arrays synthesis". Serbian Journal of Electrical Engineering 10, nr 3 (2013): 371–80. http://dx.doi.org/10.2298/sjee130317010a.

Pełny tekst źródła

Streszczenie:

A recently developed metaheuristic optimization algorithm, the Cuckoo search algorithm, is used in this paper for the synthesis of symmetric uniformly spaced linear microstrip antennas array. Cuckoo search is based on the breeding strategy of Cuckoos augmented by a Levy flight behaviour found in the foraging habits of other species. This metaheuristic is tested on amplitude only pattern synthesis and amplitude and phase pattern synthesis. In both case, the objective, is to determinate the optimal excitations element that produce a synthesized radiation pattern within given bounds specified by a pattern mask.

Style APA, Harvard, Vancouver, ISO itp.

36

Ntzoufras, Ioannis, Jonathan J. Forster i Petros Dellaportas. "Stochastic search variable selection for log-linear models". Journal of Statistical Computation and Simulation 68, nr 1 (grudzień 2000): 23–37. http://dx.doi.org/10.1080/00949650008812054.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

Anashkina, N. V., i A. N. Shurupov. "Solving linear inequalities systems with local search algorithms". Prikladnaya diskretnaya matematika. Prilozhenie, nr 8 (1.12.2015): 136–38. http://dx.doi.org/10.17223/2226308x/8/53.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

Ghosh, Subir. "Influential nonnegligible parameters under the search linear model". Communications in Statistics - Theory and Methods 16, nr 4 (styczeń 1987): 1013–25. http://dx.doi.org/10.1080/03610928708829419.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Tsai, S. M., i J. F. Yang. "Efficient algebraic code-excited linear predictive codebook search". IEE Proceedings - Vision, Image, and Signal Processing 153, nr 6 (2006): 761. http://dx.doi.org/10.1049/ip-vis:20060123.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Mladenovic, Nenad, Dragan Urosevic i Dionisio Pérez-Brito. "Variable neighborhood search for minimum linear arrangement problem". Yugoslav Journal of Operations Research 26, nr 1 (2016): 3–16. http://dx.doi.org/10.2298/yjor140928038m.

Pełny tekst źródła

Streszczenie:

The minimum linear arrangement problem is widely used and studied in many practical and theoretical applications. It consists of finding an embedding of the nodes of a graph on the line such that the sum of the resulting edge lengths is minimized. This problem is one among the classical NP-hard optimization problems and therefore there has been extensive research on exact and approximative algorithms. In this paper we present an implementation of a variable neighborhood search (VNS) for solving minimum linear arrangement problem. We use Skewed general VNS scheme that appeared to be successful in solving some recent optimization problems on graphs. Based on computational experiments, we argue that our approach is comparable with the state-of-the-art heuristic.

Style APA, Harvard, Vancouver, ISO itp.

41

Liu, P. L., B. J. Li i Y. S. Trisno. "In search of a linear electrooptic amplitude modulator". IEEE Photonics Technology Letters 3, nr 2 (luty 1991): 144–46. http://dx.doi.org/10.1109/68.76869.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Kong, Garry, David Alais i Erik Van der Burg. "Investigating Linear Separability in Visual Search for Orientation". Journal of Vision 16, nr 12 (1.09.2016): 1280. http://dx.doi.org/10.1167/16.12.1280.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Pryde, A. J., i R. M. Phatarfod. "Multiplicities of eigenvalues of some linear search schemes". Linear Algebra and its Applications 291, nr 1-3 (kwiecień 1999): 115–24. http://dx.doi.org/10.1016/s0024-3795(98)10246-x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

Lòpez, Pablo, Ernesto Pimentel, Joshua S. Hodas, Jeffrey Polakow i Lubomira Stoilova. "Isolating Resource Consumption in Linear Logic Proof Search". Electronic Notes in Theoretical Computer Science 70, nr 2 (grudzień 2002): 1–10. http://dx.doi.org/10.1016/s1571-0661(04)80502-4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Esmaeili, M., A. Alampour i T. A. Gulliver. "Decoding Binary Linear Block Codes Using Local Search". IEEE Transactions on Communications 61, nr 6 (czerwiec 2013): 2138–45. http://dx.doi.org/10.1109/tcomm.2013.041113.120057.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Cervesato, Iliano, Joshua S. Hodas i Frank Pfenning. "Efficient resource management for linear logic proof search". Theoretical Computer Science 232, nr 1-2 (luty 2000): 133–63. http://dx.doi.org/10.1016/s0304-3975(99)00173-5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Manber, Udi. "Recognizing breadth-first search trees in linear time". Information Processing Letters 34, nr 4 (kwiecień 1990): 167–71. http://dx.doi.org/10.1016/0020-0190(90)90155-q.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

Luh, Hsing, i Ray Tsaih. "An efficient search direction for linear programming problems". Computers & Operations Research 29, nr 2 (luty 2002): 195–203. http://dx.doi.org/10.1016/s0305-0548(00)00069-1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

Velez, German Correa, Fernando Mesa i Pedro Pablo Cardenas Alzate. "Linear search optimization through the Armijo rule method". Contemporary Engineering Sciences 11, nr 16 (2018): 771–78. http://dx.doi.org/10.12988/ces.2018.8121.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Boldyrev, A. I., i J. Simons. "Theoretical search for small linear doubly charged anions". Journal of Chemical Physics 98, nr 6 (15.03.1993): 4745–52. http://dx.doi.org/10.1063/1.464978.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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!