Acceder

Bibliografías temáticas / Linear search / Artículos de revistas

Siga este enlace para ver otros tipos de publicaciones sobre el tema: Linear search.

Artículos de revistas sobre el tema "Linear search"

Autor: Grafiati

Publicado: 25 de mayo de 2024

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte los 50 mejores artículos de revistas para su investigación sobre el tema "Linear search".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.

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, n.º 1 (2012): 1–22. http://dx.doi.org/10.15807/jorsj.55.1.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

2

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

3

Hester, J. H. y D. S. Hirschberg. "Self-organizing linear search". ACM Computing Surveys 17, n.º 3 (septiembre de 1985): 295–311. http://dx.doi.org/10.1145/5505.5507.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

4

Arora, Nitin, Garima Bhasin y Neha Sharma. "Two way Linear Search Algorithm". International Journal of Computer Applications 107, n.º 21 (18 de diciembre de 2014): 6–8. http://dx.doi.org/10.5120/19137-9622.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

5

Limoncelli, Thomas A. "10 optimizations on linear search". Communications of the ACM 59, n.º 9 (24 de agosto de 2016): 44–48. http://dx.doi.org/10.1145/2980976.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

6

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

7

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

8

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

9

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

10

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

11

Manski, Charles F. "Optimal Search Profiling with Linear Deterrence". American Economic Review 95, n.º 2 (1 de abril de 2005): 122–26. http://dx.doi.org/10.1257/000282805774669817.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

12

Heydari, Javad, Ali Tajer y H. Vincent Poor. "Quickest Linear Search over Correlated Sequences". IEEE Transactions on Information Theory 62, n.º 10 (octubre de 2016): 5786–808. http://dx.doi.org/10.1109/tit.2016.2593772.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

13

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

14

Gorbunov, Dmitry S. y Viacheslav A. Ilyin. "Stoponium search at photon linear collider". Journal of High Energy Physics 2000, n.º 11 (6 de noviembre de 2000): 011. http://dx.doi.org/10.1088/1126-6708/2000/11/011.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

15

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

16

Beck, Anatole y Micah Beck. "The linear search problem rides again". Israel Journal of Mathematics 53, n.º 3 (diciembre de 1986): 365–72. http://dx.doi.org/10.1007/bf02786568.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

17

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

Texto completo

Resumen

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.

Los estilos APA, Harvard, Vancouver, ISO, etc.

18

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

19

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

20

Baston, Vic y Anatole Beck. "Generalizations in the linear search problem". Israel Journal of Mathematics 90, n.º 1-3 (octubre de 1995): 301–23. http://dx.doi.org/10.1007/bf02783218.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

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.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

22

Beck, Anatole y Micah Beck. "The Revenge of the Linear Search Problem". SIAM Journal on Control and Optimization 30, n.º 1 (enero de 1992): 112–22. http://dx.doi.org/10.1137/0330008.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

23

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

24

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

25

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

26

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

27

Greenberg, Shlomo y Daniel Kogan. "Linear search applied to global motion estimation". Multimedia Systems 12, n.º 6 (22 de noviembre de 2006): 493–504. http://dx.doi.org/10.1007/s00530-006-0069-2.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

28

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

29

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

Texto completo

Resumen

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.

Los estilos APA, Harvard, Vancouver, ISO, etc.

30

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

31

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

32

P.Parmar, Vimal y 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, n.º 3 (18 de julio de 2015): 13–17. http://dx.doi.org/10.5120/21519-4495.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

33

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

Texto completo

Resumen

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.

Los estilos APA, Harvard, Vancouver, ISO, etc.

34

Vighneshvel, T. y S. P. Arun. "Does linear separability really matter? Complex visual search is explained by simple search". Journal of Vision 13, n.º 11 (12 de septiembre de 2013): 10. http://dx.doi.org/10.1167/13.11.10.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

35

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

Texto completo

Resumen

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.

Los estilos APA, Harvard, Vancouver, ISO, etc.

36

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

37

Anashkina, N. V. y A. N. Shurupov. "Solving linear inequalities systems with local search algorithms". Prikladnaya diskretnaya matematika. Prilozhenie, n.º 8 (1 de diciembre de 2015): 136–38. http://dx.doi.org/10.17223/2226308x/8/53.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

38

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

39

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

40

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

Texto completo

Resumen

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.

Los estilos APA, Harvard, Vancouver, ISO, etc.

41

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

42

Kong, Garry, David Alais y Erik Van der Burg. "Investigating Linear Separability in Visual Search for Orientation". Journal of Vision 16, n.º 12 (1 de septiembre de 2016): 1280. http://dx.doi.org/10.1167/16.12.1280.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

43

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

44

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

45

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

46

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

47

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

48

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

49

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

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

50

Boldyrev, A. I. y J. Simons. "Theoretical search for small linear doubly charged anions". Journal of Chemical Physics 98, n.º 6 (15 de marzo de 1993): 4745–52. http://dx.doi.org/10.1063/1.464978.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!