Artykuły w czasopismach: „Complete search”

1

Paty, Morgan. "Academic Search Complete". Charleston Advisor 14, nr 3 (1.01.2013): 5–7. http://dx.doi.org/10.5260/chara.14.3.5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Mai, J. L., i D. Zielinski. "Complete enumeration: a search for wholeness". Journal of Mathematics and the Arts 1, nr 3 (wrzesień 2007): 159–72. http://dx.doi.org/10.1080/17513470701734989.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

�sterg�rd, Patric R. J. "Computer search for small complete caps". Journal of Geometry 69, nr 1-2 (listopad 2000): 172–79. http://dx.doi.org/10.1007/bf01237484.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

GREENLAW, RAYMOND. "BREADTH-DEPTH SEARCH IS ${\mathcal P}$-COMPLETE". Parallel Processing Letters 03, nr 03 (wrzesień 1993): 209–22. http://dx.doi.org/10.1142/s0129626493000253.

Pełny tekst źródła

Streszczenie:

The parallel complexity of a search strategy that combines attributes of both breadth-first search and depth-first search is studied. The search called breadth-depth search was defined by Horowitz and Sahni. The search technique has applications in branch-and-bound strategies. Kindervater and Lenstra posed the complexity of this type of search strategy as an open problem. We resolve their question by showing that a natural decision problem based on breadth-depth search is [Formula: see text]-complete. Specifically, we prove that if given a graph G=(V, E) either directed or undirected, a start vertex s∈V, and two designated vertices u and v in V, then the problem of deciding whether u is visited before v by a breadth-depth search originating from s is [Formula: see text]-complete. The search can be based either on vertex numbers or fixed ordered adjacency lists. Our reductions differ for directed/undirected graphs and depending on whether vertex numbers/fixed ordered adjacency lists are used. These results indicate breadth-depth search is highly sequential in nature and probably will not adapt to a fast parallel solution, unless [Formula: see text] equals [Formula: see text].

Style APA, Harvard, Vancouver, ISO itp.

5

John, Collether. "Complete Neighbourhood Search Heuristic Algorithm for Portfolio Optimization". Tanzania Journal of Engineering and Technology 40, nr 2 (20.02.2022): 97–104. http://dx.doi.org/10.52339/tjet.v40i2.736.

Pełny tekst źródła

Streszczenie:

In portfolio optimization, the fundamental goal of an investor is to optimally allocate investments between different assets. Mean-variance optimization methods make unrealistic assumptions to solve the problem of optimal allocation. On the other hand, when realistic constraints like holding size and cardinality are introduced it leads to optimal asset allocation which differ from the mean variance optimization. The resulting optimization problem become quite complex as it exhibits multiple local extrema and discontinuities. Heuristic algorithms work well for the complex problem. Therefore, a heuristic algorithm is developed which is based on hill climbing complete (HC-C). It is utilized to solve the extended portfolio optimization problem. In order to validate its performance, the proposed HC-C is tested with standard portfolio optimization problem. Experimental results are benchmarked with the quadratic programming method and threshold accepting (TA) algorithm.

Style APA, Harvard, Vancouver, ISO itp.

6

Pollmann, Stefan, i Eran Zaidel. "Redundancy gains for visual search after complete commissurotomy." Neuropsychology 13, nr 2 (1999): 246–58. http://dx.doi.org/10.1037/0894-4105.13.2.246.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Weixia, Gu. "China’s Search for Complete Separability of the Arbitral Agreement". Asian International Arbitration Journal 3, Issue 2 (1.12.2007): 163–75. http://dx.doi.org/10.54648/aiaj2007006.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Neumaier, Arnold. "Complete search in continuous global optimization and constraint satisfaction". Acta Numerica 13 (maj 2004): 271–369. http://dx.doi.org/10.1017/s0962492904000194.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Onishi, Toshikazu, Akira Mizuno, Akiko Kawamura, Kengo Tachihara i Yasuo Fukui. "A Complete Search for Dense Cloud Cores in Taurus". Astrophysical Journal 575, nr 2 (20.08.2002): 950–73. http://dx.doi.org/10.1086/341347.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Foertsch, Julie, i Morton Ann Gernsbacher. "In search of complete comprehension: Getting “minimalists” to work". Discourse Processes 18, nr 3 (listopad 1994): 271–96. http://dx.doi.org/10.1080/01638539409544896.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Vitek, O., C. Bailey-Kellogg, B. Craig, P. Kuliniewicz i J. Vitek. "Reconsidering complete search algorithms for protein backbone NMR assignment". Bioinformatics 21, Suppl 2 (1.09.2005): ii230—ii236. http://dx.doi.org/10.1093/bioinformatics/bti1138.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Guo, Wen-Sheng, Guo-Wu Yang, William N. N. Hung i Xiaoyu Song. "Complete Boolean Satisfiability Solving Algorithms Based on Local Search". Journal of Computer Science and Technology 28, nr 2 (marzec 2013): 247–54. http://dx.doi.org/10.1007/s11390-013-1326-4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

Löser, Alexander, Christoph Nagel, Stephan Pieper i Christoph Boden. "Beyond search: Retrieving complete tuples from a text-database". Information Systems Frontiers 15, nr 3 (23.01.2013): 311–29. http://dx.doi.org/10.1007/s10796-012-9403-8.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

Fickert, Maximilian, i Joerg Hoffmann. "Complete Local Search: Boosting Hill-Climbing through Online Relaxation Refinement". Proceedings of the International Conference on Automated Planning and Scheduling 27 (5.06.2017): 107–15. http://dx.doi.org/10.1609/icaps.v27i1.13801.

Pełny tekst źródła

Streszczenie:

Several known heuristic functions can capture the input at different levels of precision, and support relaxation-refinement operations guaranteeing to converge to exact information in a finite number of steps. A natural idea is to use such refinement online, during search, yet this has barely been addressed. We do so here for local search, where relaxation refinement is particularly appealing: escape local minima not by search, but by removing them from the search surface. Thanks to convergence, such an escape is always possible. We design a family of hill-climbing algorithms along these lines. We show that these are complete, even when using helpful actions pruning. Using them with the partial delete relaxation heuristic hCFF, the best-performing variant outclasses FF's enforced hill-climbing, outperforms FF, outperforms dual-queue greedy best-first search with hFF, and in 6 IPC domains outperforms both LAMA and Mercury.

Style APA, Harvard, Vancouver, ISO itp.

15

Browne, I. W. A., i S. T. Myers. "The CLASS Gravitational Lens Search". Symposium - International Astronomical Union 201 (2005): 443–44. http://dx.doi.org/10.1017/s0074180900216586.

Pełny tekst źródła

Streszczenie:

To exploit gravitational lensing for cosmology large, reliable and statistically complete surveys are required. With the Cosmic Lens All-Sky Survey (CLASS) we have set out to achieve these goals. We pre-select targets to be flat spectrum radio sources and map every source with the VLA at 200mas resolution. Candidates having multiple compact components with flux density ratios ≤10:1 and separation in the range 0.3 to 15 arcsec are followed up with high resolution MERLIN and VLBA observations, eliminating those candidates which do not match strictly defined surface brightness and morphological criteria. A complete sample of 11685 sources have been surveyed and nineteen lens systems have been found.

Style APA, Harvard, Vancouver, ISO itp.

16

HUANG, GENG-DIAN, i BOW-YAW WANG. "COMPLETE SAT-BASED MODEL CHECKING FOR CONTEXT-FREE PROCESSES". International Journal of Foundations of Computer Science 21, nr 02 (kwiecień 2010): 115–34. http://dx.doi.org/10.1142/s0129054110007179.

Pełny tekst źródła

Streszczenie:

A complete SAT-based model checking algorithm for context-free processes is presented. We reduce proof search in local model checking to Boolean satisfiability. Bounded proof search can therefore be performed by SAT solvers. Moreover, the completeness of proof search is reduced to Boolean unsatisfiability and hence can be checked by SAT solvers. By encoding the local model checking algorithm in [13], SAT solvers are able to verify properties in the universal fragment of alternation-free µ-calculus formulae on context-free processes. Since software programs can be modeled by context-free processes, our result demonstrates that a purely SAT-based algorithm for software verification is indeed possible.

Style APA, Harvard, Vancouver, ISO itp.

17

Marinescu, Radu, Junkyu Lee, Rina Dechter i Alexander Ihler. "AND/OR Search for Marginal MAP". Journal of Artificial Intelligence Research 63 (22.12.2018): 875–921. http://dx.doi.org/10.1613/jair.1.11265.

Pełny tekst źródła

Streszczenie:

Mixed inference such as the marginal MAP query (some variables marginalized by summation and others by maximization) is key to many prediction and decision models. It is known to be extremely hard; the problem is NPPP-complete while the decision problem for MAP is only NP-complete and the summation problem is #P-complete. Consequently, approximation anytime schemes are essential. In this paper, we show that the framework of heuristic AND/OR search, which exploits conditional independence in the graphical model, coupled with variational-based mini-bucket heuristics can be extended to this task and yield powerful state-of-the-art schemes. Specifically, we explore the complementary properties of best-first search for reducing the number of conditional sums and providing time-improving upper bounds, with depth-first search for rapidly generating and improving solutions and lower bounds. We show empirically that a class of solvers that interleaves depth-first with best-first schemes emerges as the most competitive anytime scheme.

Style APA, Harvard, Vancouver, ISO itp.

18

Stiffler, Nicholas M., i Jason M. O’Kane. "Complete and optimal visibility-based pursuit-evasion". International Journal of Robotics Research 36, nr 8 (lipiec 2017): 923–46. http://dx.doi.org/10.1177/0278364917711535.

Pełny tekst źródła

Streszczenie:

This paper computes a minimum-length pursuer trajectory that solves a visibility-based pursuit-evasion problem in which a single pursuer moving through a simply-connected polygonal environment seeks to locate an evader which may move arbitrarily fast, using an omni-directional field-of-view that extends to the environment boundary. We present a complete algorithm that computes a minimum-cost pursuer trajectory that ensures that the evader is captured, or reports in finite time that no such trajectory exists. This result improves upon the known algorithm of Guibas, Latombe, LaValle, Lin, and Motwani, which is complete but makes no guarantees about the quality of the solution. Our algorithm employs a branch-and-bound forward search that considers pursuer trajectories that could potentially lead to an optimal pursuer strategy. The search is performed on an exponential graph that can generate an infinite number of unique pursuer trajectories, so we must conduct meticulous pruning during the search to quickly discard pursuer trajectories that are demonstrably suboptimal. We describe an implementation of the algorithm, along with experiments that measure its performance in several environments with a variety of pruning operations.

Style APA, Harvard, Vancouver, ISO itp.

19

YAMAGISHI, Yuki, Kazuo AOYAMA, Kazumi SAITO i Tetsuo IKEDA. "Efficient Similarity Search with a Pivot-Based Complete Binary Tree". IEICE Transactions on Information and Systems E100.D, nr 10 (2017): 2526–36. http://dx.doi.org/10.1587/transinf.2017edp7100.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

Badaloni, Silvana, Francesco Sambo i Francesco Venco. "Bayesian Network structure learning: Hybridizing complete search with independence tests". AI Communications 28, nr 2 (2015): 309–22. http://dx.doi.org/10.3233/aic-140634.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

OBA, Risaburo. "Several Trials in the Search for a Complete Cavitation Concept". JSME international journal. Ser. 2, Fluids engineering, heat transfer, power, combustion, thermophysical properties 33, nr 4 (1990): 621–28. http://dx.doi.org/10.1299/jsmeb1988.33.4_621.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

COURTNEY, ALAN J., i LIPING GUAN. "Visual search performance with complete and incomplete visual lobe areas". Ergonomics 39, nr 5 (maj 1996): 749–56. http://dx.doi.org/10.1080/00140139608964496.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

Grover, Lov K. "Local search and the local structure of NP-complete problems". Operations Research Letters 12, nr 4 (październik 1992): 235–43. http://dx.doi.org/10.1016/0167-6377(92)90049-9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Xue, Yuan, Boting Yang, Farong Zhong i Sandra Zilles. "The Fast Search Number of a Complete k-Partite Graph". Algorithmica 80, nr 12 (21.05.2018): 3959–81. http://dx.doi.org/10.1007/s00453-018-0456-z.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

Brandão, Filipe, i João Pedro Pedroso. "A complete search method for the relaxed traveling tournament problem". EURO Journal on Computational Optimization 2, nr 1-2 (30.04.2013): 77–86. http://dx.doi.org/10.1007/s13675-013-0010-3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Ismail, Yasser. "A Complete Verification of a Full Search Motion Estimation Engine". International Journal of Computing and Digital Systems 4, nr 4 (1.10.2015): 221–32. http://dx.doi.org/10.12785/ijcds/040401.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Holbreich, Mark. "In search of Eosinophilic Esophagitis: Adding a complete eating history". Annals of Allergy, Asthma & Immunology 124, nr 3 (marzec 2020): 288. http://dx.doi.org/10.1016/j.anai.2019.12.009.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Khan, Amna, Iram Noreen, Hyejeong Ryu, Nakju Lett Doh i Zulfiqar Habib. "Online complete coverage path planning using two-way proximity search". Intelligent Service Robotics 10, nr 3 (16.03.2017): 229–40. http://dx.doi.org/10.1007/s11370-017-0223-z.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Weikert, Dominik, Sebastian Mai i Sanaz Mostaghim. "Particle Swarm Contour Search Algorithm". Entropy 22, nr 4 (2.04.2020): 407. http://dx.doi.org/10.3390/e22040407.

Pełny tekst źródła

Streszczenie:

In this article, we present a new algorithm called Particle Swarm Contour Search (PSCS)—a Particle Swarm Optimisation inspired algorithm to find object contours in 2D environments. Currently, most contour-finding algorithms are based on image processing and require a complete overview of the search space in which the contour is to be found. However, for real-world applications this would require a complete knowledge about the search space, which may not be always feasible or possible. The proposed algorithm removes this requirement and is only based on the local information of the particles to accurately identify a contour. Particles search for the contour of an object and then traverse alongside using their known information about positions in- and out-side of the object. Our experiments show that the proposed PSCS algorithm can deliver comparable results as the state-of-the-art.

Style APA, Harvard, Vancouver, ISO itp.

30

Gautier, Pieter A., i Christian L. Holzner. "Simultaneous Search and Efficiency of Entry and Search Intensity". American Economic Journal: Microeconomics 9, nr 3 (1.08.2017): 245–82. http://dx.doi.org/10.1257/mic.20160088.

Pełny tekst źródła

Streszczenie:

We consider a model where firms open vacancies and post and commit to a wage mechanism. Search is costly and workers simultaneously apply to multiple jobs. Firms can be connected to multiple workers and workers to multiple firms. We use a new method to derive the expected maximum number of matches in a large market as a function of the number of applications and market tightness. We also derive the conditions under which firm entry, worker participation, and search intensity are socially efficient. Finally, we show that a sequential auction under incomplete information can establish the social optimum and discuss some alternative mechanisms that can, under complete information of the entire network, also deliver social efficiency. (JEL D12, D44, D83, J23, J31, J64, M51)

Style APA, Harvard, Vancouver, ISO itp.

31

Savkin, Andrey V., i Hang Li. "A safe area search and map building algorithm for a wheeled mobile robot in complex unknown cluttered environments". Robotica 36, nr 1 (10.04.2017): 96–118. http://dx.doi.org/10.1017/s0263574717000194.

Pełny tekst źródła

Streszczenie:

SUMMARYIn this paper, a safe map building and area search algorithm for a mobile robot in a closed unknown environment with obstacles is presented. A range finder sensor is used to detect the environment. The objective is to perform a complete search of the environment and build a complete map of it while avoiding collision with the obstacles. The developed robot navigation algorithm is randomized. It is proved that with probability 1 the robot completes its task in a finite time. Computer simulations and experiments with a real Pioneer-3DX robot confirm the performance of the proposed method.

Style APA, Harvard, Vancouver, ISO itp.

32

Kraus-Friedberg, Chana. "MEDLINE Complete". Charleston Advisor 22, nr 3 (1.01.2021): 33–35. http://dx.doi.org/10.5260/chara.22.3.33.

Pełny tekst źródła

Streszczenie:

MEDLINE Complete is an EBSCO database which offers an alternative interface for accessing MEDLINE, and includes full-text of over 2,000 of the journals included in MEDLINE. As such, it includes primarily academic journals with some gray literature from government agencies and NGOs such as the CDC (Center for Disease Control and Prevention) and the WHO (World Health Organization). MEDLINE Complete includes MeSH (Medical Subject Heading) indexing and filters similar to those provided in PubMed, but the filters are not as well integrated into the interface as they are in PubMed. The search interface and indexing also have some quirks that librarians will want to be aware of. The main value-added feature of MEDLINE Complete, however, is the full-text access it provides, and this is likely to be the deciding factor for purchase. For libraries that subscribe to EBSCO’s MEDLINE with Full-text (a version of the database with full-text access to fewer publications) or are interested in acquiring integrated full-text access to a large group of biomedical journals, MEDLINE Complete may be appealing. On the other hand, MEDLINE Complete is less friendly to advanced medical searching than PubMed is. Depending on the existing full-text resources and patron needs at individual libraries, MEDLINE Complete may or may not be an improvement over integrating full-text from other vendors into the PubMed interface.

Style APA, Harvard, Vancouver, ISO itp.

33

Zhang, Rui, i Tian Chen. "Fast quantum search driven by environmental engineering". Communications in Theoretical Physics 74, nr 4 (1.04.2022): 045101. http://dx.doi.org/10.1088/1572-9494/ac539d.

Pełny tekst źródła

Streszczenie:

Abstract Studies have demonstrated that a joined complete graph is a typical mathematical model that can support a fast quantum search. In this paper, we study the implementation of joined complete graphs in atomic systems and realize a quantum search of runtime O ( N ) based on this implementation with a success probability of 50%. Even though the practical systems inevitably interact with the surrounding environment, we reveal that a successful quantum search can be realized through delicately engineering the environment itself. We consider that our study will bring about a feasible way to realize quantum information processing including quantum algorithms in reality.

Style APA, Harvard, Vancouver, ISO itp.

34

Hendricks, Kenneth, Alan Sorensen i Thomas Wiseman. "Observational Learning and Demand for Search Goods". American Economic Journal: Microeconomics 4, nr 1 (1.02.2012): 1–31. http://dx.doi.org/10.1257/mic.4.1.1.

Pełny tekst źródła

Streszczenie:

We develop a model of herds in which consumers observe only the aggregate purchase history, not the complete ordered history of search actions. We show that the purchasing information changes the conditions under which herds can occur for both low- and high-quality products. Inferior products are certain to be ignored; high quality products may be ignored, but complete learning may also occur. We obtain closed form solutions for the probabilities of these events and conduct comparative statics. We test the model's predictions using data from an online music market created by Salganik, Dodds, and Watts (2006). (JEL D11, D12, L82)

Style APA, Harvard, Vancouver, ISO itp.

35

Hernandez, Carlos, Jorge Baier, Tansel Uras i Sven Koenig. "Paper Summary: Time-Bounded Adaptive A*". Proceedings of the International Symposium on Combinatorial Search 3, nr 1 (20.08.2021): 184–85. http://dx.doi.org/10.1609/socs.v3i1.18228.

Pełny tekst źródła

Streszczenie:

This paper summarizes our AAMAS 2012 paper on "Time-Bounded Adaptive A*," which introduces the game time model to evaluate search algorithms in real-time settings, such as video games. It then extends the existing real-time search algorithm TBA* to path planning with the freespace assumption in initially partially or completely unknown terrain, resulting in Time-Bounded Adaptive A* (TBAA*). TBAA* needs fewer time intervals in the game time model than several state-of-the-art complete and real-time search algorithms and about the same number of time intervals as the best compared complete search algorithm, even though it has the advantage over complete search algorithms that the agent starts to move right away.

Style APA, Harvard, Vancouver, ISO itp.

36

Mukherjee, Rohan, Swarat Chaudhuri i Chris Jermaine. "Searching a database of source codes using contextualized code search". Proceedings of the VLDB Endowment 13, nr 10 (czerwiec 2020): 1765–78. http://dx.doi.org/10.14778/3401960.3401972.

Pełny tekst źródła

Streszczenie:

Consider the case where a programmer has written some part of a program, but has left part of the program (such as a method or a function body) incomplete. The goal is to use the context surrounding the missing code to automatically "figure out" which of the codes in the database would be useful to the programmer in order to help complete the missing code. The search is "contextualized" in the sense that the search engine should use clues in the partially-completed code to figure out which database code is most useful. The user should not be required to formulate an explicit query. We cast contextualized code search as a learning problem, where the goal is to learn a distribution function computing the likelihood that each database code completes the program, and propose a neural model for predicting which database code is likely to be most useful. Because it will be prohibitively expensive to apply a neural model to each code in a database of millions or billions of codes at search time, one of our key technical concerns is ensuring a speedy search. We address this by learning a "reverse encoder" that can be used to reduce the problem of evaluating each database code to computing a convolution of two normal distributions.

Style APA, Harvard, Vancouver, ISO itp.

37

Lach, Helen W. "SELF-EFFICACY AND FEAR OF FALLING: IN SEARCH OF COMPLETE THEORY". Journal of the American Geriatrics Society 54, nr 2 (luty 2006): 381–82. http://dx.doi.org/10.1111/j.1532-5415.2005.00592_11_1.x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

Hemann, Jason, Daniel P. Friedman, William E. Byrd i Matthew Might. "A small embedding of logic programming with a simple complete search". ACM SIGPLAN Notices 52, nr 2 (11.05.2017): 96–107. http://dx.doi.org/10.1145/3093334.2989230.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Kube, Paul R. "Unbounded visual search is not both biologically plausible and NP - Complete". Behavioral and Brain Sciences 14, nr 4 (grudzień 1991): 768–70. http://dx.doi.org/10.1017/s0140525x00072472.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Divecha, Jyoti. "Search for suitable incomplete block designs for complete diallel cross systems". Journal of Applied Statistics 27, nr 1 (styczeń 2000): 49–62. http://dx.doi.org/10.1080/02664760021826.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

Crespelle, Christophe, i Philippe Gambette. "Unrestricted and complete Breadth-First Search of trapezoid graphs in time". Information Processing Letters 110, nr 12-13 (czerwiec 2010): 497–502. http://dx.doi.org/10.1016/j.ipl.2010.03.015.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Davydov, Alexander A., Giorgio Faina, Stefano Marcugini i Fernanda Pambianco. "Computer search in projective planes for the sizes of complete arcs". Journal of Geometry 82, nr 1-2 (sierpień 2005): 50–62. http://dx.doi.org/10.1007/s00022-004-1719-1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Enkin, Murray, i Jini Hetherington. "Collecting the Evidence Systematically: Ensuring That It Is Complete and Up-to-Date". International Journal of Technology Assessment in Health Care 12, nr 2 (1996): 276–79. http://dx.doi.org/10.1017/s0266462300009624.

Pełny tekst źródła

Streszczenie:

AbstractA complete and comprehensive search of the relevant evidence is an essential step in the preparation of a scientific systematic review. The Cochrane Pregnancy and Childbirth Database consists of some 600 systematic reviews, based on almost 6,000 randomized or quasi-randomized trials of care during pregnancy and childbirth. As ascertainment from electronic search of the National Library of Medicine MEDLINE database was not complete, the mainstay of our search strategy was a systematic hand search of some 60 journals, beginning with volumes published in 1950. Additional references were obtained from the list of references in primary research reports and conference reports. A major effort was made to identify unpublished trials and to obtain unpublished data from published trials.

Style APA, Harvard, Vancouver, ISO itp.

44

Chen, Siyi, Lucas Schnabl, Hermann J. Müller i Markus Conci. "Amodal Completion of a Target Template Enhances Attentional Guidance in Visual Search". i-Perception 9, nr 4 (lipiec 2018): 204166951879624. http://dx.doi.org/10.1177/2041669518796240.

Pełny tekst źródła

Streszczenie:

When searching for a target object in cluttered environments, our visual system appears to complete missing parts of occluded objects—a mechanism known as “amodal completion.” This study investigated how different variants of completion influence visual search for an occluded target object. In two experiments, participants searched for a target among distractors in displays that either presented composite objects (notched shapes abutting an occluding square) or corresponding simple objects. The results showed enhanced search performance when composite objects were interpreted in terms of a globally completed whole. This search benefit for global completions was found to be dependent on the availability of a coherent, informative simple-object context. Overall, these findings suggest that attentional guidance in visual search may be based on a target “template” that represents a globally completed image of the occluded (target) object in accordance with prior experience.

Style APA, Harvard, Vancouver, ISO itp.

45

Gavazzoni, Alessandro, Francisco Rosso Júnior i Jefferson Ricardo Pereira. "Immediate complete denture: a contemporary view". Journal of Research in Dentistry 3, nr 2 (13.10.2015): 646. http://dx.doi.org/10.19177/jrd.v3e22015646-653.

Pełny tekst źródła

Streszczenie:

AIM: The objective of this study was to describe the advantages, disadvantages, indications and some limitations of the Immediate Complete Denture (ICD) treatment. MATERIAL AND METHODS: An electronic and manual search was made in SciELO, SCOPUS, MEDLINE/PubMed databases from 1972 to 2015. Publications in Portuguese, Spanish and English were selected to write this narrative review of the literature. CONCLUSION: Despite the limitations of this study it was conclude that treatment with ICD is the best option because of its satisfactory results.

Style APA, Harvard, Vancouver, ISO itp.

46

Jordi, C., E. Trullols, D. Galadí-Enríquez i F. Lahulla. "Cepheus OB3: Search for Faint Members". Symposium - International Astronomical Union 164 (1995): 376. http://dx.doi.org/10.1017/s0074180900108940.

Pełny tekst źródła

Streszczenie:

Johnson UBVRI CCD-photometry was performed for 18 fields (3′×4.4′) in the association Cepheus OB3 using the 1.23m telescope of CAHA at Calar Alto (Almería, Spain). A total of 1055 stars was detected and the sample is complete down to V ≈ 19mag, although only 130 stars were measured with the five filters.

Style APA, Harvard, Vancouver, ISO itp.

47

Vasquez, Michel, i Nicolas Zufferey. "Consistent Neighborhood Search for Combinatorial Optimization". ISRN Computational Mathematics 2012 (13.09.2012): 1–12. http://dx.doi.org/10.5402/2012/671423.

Pełny tekst źródła

Streszczenie:

Many optimization problems (from academia or industry) require the use of a local search to find a satisfying solution in a reasonable amount of time, even if the optimality is not guaranteed. Usually, local search algorithms operate in a search space which contains complete solutions (feasible or not) to the problem. In contrast, in Consistent Neighborhood Search (CNS), after each variable assignment, the conflicting variables are deleted to keep the partial solution feasible, and the search can stop when all the variables have a value. In this paper, we formally propose a new heuristic solution method, CNS, which has a search behavior between exhaustive tree search and local search working with complete solutions. We then discuss, with a unified view, the great success of some existing heuristics, which can however be considered within the CNS framework, in various fields: graph coloring, frequency assignment in telecommunication networks, vehicle fleet management with maintenance constraints, and satellite range scheduling. Moreover, some lessons are given in order to have guidelines for the adaptation of CNS to other problems.

Style APA, Harvard, Vancouver, ISO itp.

48

Zhang, Jin, Xin Cai, Taowen Le, Wei Fei i Feicheng Ma. "A Study on Effective Measurement of Search Results from Search Engines". Journal of Global Information Management 27, nr 1 (styczeń 2019): 196–221. http://dx.doi.org/10.4018/jgim.2019010110.

Pełny tekst źródła

Streszczenie:

This article describes how as internet technology continues to change and improve lives and societies worldwide, effective global information management becomes increasingly critical, and effective Internet information retrieval systems become more and more significant in providing Internet users worldwide with accurate and complete information. Search engine evaluation is an important research field as search engines directly determine the quality of information users' Internet searches. Relevance-decrease pattern/model plays an important role in search engine result evaluation. This research studies effective measurement of search results through investigating relevance-decrease patterns of search results from two popular search engines: Google and Bing. The findings can be applied to relevance-evaluation of search results from other information retrieval systems such as OPAC, can help make search engine evaluations more accurate and sound, and can provide global information management personnel with valuable insights.

Style APA, Harvard, Vancouver, ISO itp.

49

Luna, Ryan, i Kostas Bekris. "Efficient and Complete Centralized Multi-Robot Path Planning". Proceedings of the International Symposium on Combinatorial Search 2, nr 1 (19.08.2021): 201–2. http://dx.doi.org/10.1609/socs.v2i1.18209.

Pełny tekst źródła

Streszczenie:

Multi-robot path planning is abstracted as the problem of computing a set of non-colliding paths on a graph for multiple robots. A naive search of the composite search space, although complete, has exponential complexity and becomes computationally prohibitive for problems with just a few robots. This work proposes an efficient and complete algorithm for solving a general class of multi-robot path planning problems, specifically those where there are at most n-2 robots in a connected graph of n vertices. The algorithm employs two primitives: a "push" operation where a robot moves toward its goal until no further progress can be made, and a "swap" operation that allows two robots to swap positions without altering the configuration of any other robot. Simulated experiments compare the proposed approach with several other centralized and decoupled planners, and show that the proposed technique has highly competitive computation time and easily scales to problems involving 100s of robots, solving them in under 5 seconds.

Style APA, Harvard, Vancouver, ISO itp.

50

Medi, Alexandre, Tenda Okimoto i Katsumi Inoue. "A Two-Phase Complete Algorithm for Multi-Objective Distributed Constraint Optimization". Journal of Advanced Computational Intelligence and Intelligent Informatics 18, nr 4 (20.07.2014): 573–80. http://dx.doi.org/10.20965/jaciii.2014.p0573.

Pełny tekst źródła

Streszczenie:

A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Many application problems in multi-agent systems can be formalized as DCOPs. However, many real world optimization problems involve multiple criteria that should be considered separately and optimized simultaneously. A Multi-Objective Distributed Constraint Optimization Problem (MO-DCOP) is an extension of a mono-objective DCOP. Compared to DCOPs, there exists few works on MO-DCOPs. In this paper, we develop a novel complete algorithm for solving an MO-DCOP. This algorithm utilizes a widely used method called Pareto Local Search (PLS) to generate an approximation of the Pareto front. Then, the obtained information is used to guide the search thresholds in a Branch and Bound algorithm. In the evaluations, we evaluate the runtime of our algorithm and show empirically that using a Pareto front approximation obtained by a PLS algorithm allows to significantly speed-up the search in a Branch and Bound algorithm.

Style APA, Harvard, Vancouver, ISO itp.

Artykuły w czasopismach na temat „Complete search”

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