Relevant bibliographies by topics / Uninformed search

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Uninformed search'

Author: Grafiati
Published: 28 June 2021
Last updated: 12 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Uninformed search.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Uninformed search"

1

Janssen, Maarten, and Sandro Shelegia. "Consumer Search and Double Marginalization." American Economic Review 105, no. 6 (June 1, 2015): 1683–710. http://dx.doi.org/10.1257/aer.20121317.

Full text
Abstract:
The well-known double marginalization problem understates the inefficiencies arising from vertical relations in consumer search markets where consumers are uninformed about the wholesale prices charged by manufacturers to retailers. Consumer search provides a monopoly manufacturer with an additional incentive to increase its price, worsening the double marginalization problem and lowering the manufacturer's profits. Nevertheless, manufacturers in more competitive wholesale markets may not have an incentive to reveal their prices to consumers. We show that retail prices decrease in search cost, and so both industry profits and consumer surplus increase in search cost. (JEL D11, D42, D83, L12, L25, L60, L81)
APA, Harvard, Vancouver, ISO, and other styles
2

Alhassan, Tahani Q., Shefaa S. Omar, and Lamiaa A. Elrefaei. "Game of Bloxorz Solving Agent Using Informed and Uninformed Search Strategies." Procedia Computer Science 163 (2019): 391–99. http://dx.doi.org/10.1016/j.procs.2019.12.121.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Clark, Andy, and Chris Thornton. "Trading spaces: Computation, representation, and the limits of uninformed learning." Behavioral and Brain Sciences 20, no. 1 (March 1997): 57–66. http://dx.doi.org/10.1017/s0140525x97000022.

Full text
Abstract:
Some regularities enjoy only an attenuated existence in a body of training data. These are regularities whose statistical visibility depends on some systematic recoding of the data. The space of possible recodings is, however, infinitely large – it is the space of applicable Turing machines. As a result, mappings that pivot on such attenuated regularities cannot, in general, be found by brute-force search. The class of problems that present such mappings we call the class of “type-2 problems.” Type-1 problems, by contrast, present tractable problems of search insofar as the relevant regularities can be found by sampling the input data as originally coded. Type-2 problems, we suggest, present neither rare nor pathological cases. They are rife in biologically realistic settings and in domains ranging from simple animat (simulated animal or autonomous robot) behaviors to language acquisition. Not only are such problems rife – they are standardly solved! This presents a puzzle. How, given the statistical intractability of these type-2 cases, does nature turn the trick? One answer, which we do not pursue, is to suppose that evolution gifts us with exactly the right set of recoding biases so as to reduce specific type-2 problems to (tractable) type-1 mappings. Such a heavy-duty nativism is no doubt sometimes plausible. But we believe there are other, more general mechanisms also at work. Such mechanisms provide general (not task-specific) strategies for managing problems of type-2 complexity. Several such mechanisms are investigated. At the heart of each is a fundamental ploy – namely, the maximal exploitation of states of representation already achieved by prior, simpler (type-1) learning so as to reduce the amount of subsequent computational search. Such exploitation both characterizes and helps make unitary sense of a diverse range of mechanisms. These include simple incremental learning (Elman 1993), modular connectionism (Jacobs et al. 1991), and the developmental hypothesis of “representational redescription” (Karmiloff-Smith 1979; 1992). In addition, the most distinctive features of human cognition – language and culture – may themselves be viewed as adaptations enabling this representation/computation trade-off to be pursued on an even grander scale.
APA, Harvard, Vancouver, ISO, and other styles
4

Grabe, Mark, James Antes, Ingrid Thorson, and Helen Kahn. "Eye Fixation Patterns during Informed and Uninformed Comprehension Monitoring." Journal of Reading Behavior 19, no. 2 (June 1987): 123–40. http://dx.doi.org/10.1080/10862968709547592.

Full text
Abstract:
This study investigates the pattern of eye movements produced when adult readers encounter cross-sentence contradictions. Subjects read paragraphs which did or did not contain contradictions while their eye movements were being monitored. Uninformed subjects were asked to prepare to answer a question that would follow each paragraph. Informed subjects were told that the paragraphs might contain contradictions and that they were to prepare to report the contradictions and to answer a question after each paragraph. Eye fixations were categorized to indicate the frequency of different operationally defined patterns of eye movements. Analyses of the frequency of these categories provided evidence that both informed and uninformed subjects were aware of the inserted contradictions and that instructions to search for inserted errors caused readers to alter their reading behavior.
APA, Harvard, Vancouver, ISO, and other styles
5

Ernst, Gidon, Sean Sedwards, Zhenya Zhang, and Ichiro Hasuo. "Falsification of Hybrid Systems Using Adaptive Probabilistic Search." ACM Transactions on Modeling and Computer Simulation 31, no. 3 (July 31, 2021): 1–22. http://dx.doi.org/10.1145/3459605.

Full text
Abstract:
We present and analyse an algorithm that quickly finds falsifying inputs for hybrid systems. Our method is based on a probabilistically directed tree search, whose distribution adapts to consider an increasingly fine-grained discretization of the input space. In experiments with standard benchmarks, our algorithm shows comparable or better performance to existing techniques, yet it does not build an explicit model of a system. Instead, at each decision point within a single trial, it makes an uninformed probabilistic choice between simple strategies to extend the input signal by means of exploration or exploitation. Key to our approach is the way input signal space is decomposed into levels, such that coarse segments are more probable than fine segments. We perform experiments to demonstrate how and why our approach works, finding that a fully randomized exploration strategy performs as well as our original algorithm that exploits robustness. We propose this strategy as a new baseline for falsification and conclude that more discriminative benchmarks are required.
APA, Harvard, Vancouver, ISO, and other styles
6

Krawiec, Krzysztof. "Opening the Black Box: Alternative Search Drivers for Genetic Programming and Test-based Problems." MENDEL 23, no. 1 (June 1, 2017): 1–6. http://dx.doi.org/10.13164/mendel.2017.1.001.

Full text
Abstract:
Test-based problems are search and optimization problems in which candidate solutions interact with multiple tests (examples, fitness cases, environments) in order to be evaluated. The approach conventionally adopted in most search and optimization algorithms involves aggregating the interaction outcomes into a scalar objective. However, passing different tests may require unrelated `skills' that candidate solutions may vary on.Scalar tness is inherently incapable of capturing such di erences and leaves a search algorithm largely uninformed about the diverse qualities of individual candidate solutions. In this paper, we discuss the implications of this fact and present a range of methods that avoid scalarization by turning the outcomes of interactions between programs and tests into 'search drivers' - partial, heuristic, transient pseudo-objectives that form multifaceted characterizations of candidate solutions. We demonstrate the feasibility of this approach by reviewing the experimental evidence from past work, confront it with related research endeavors, and embed it into a broader context of behavioral program synthesis.
APA, Harvard, Vancouver, ISO, and other styles
7

Yoon, Clara E., Karianne J. Bergen, Kexin Rong, Hashem Elezabi, William L. Ellsworth, Gregory C. Beroza, Peter Bailis, and Philip Levis. "Unsupervised Large‐Scale Search for Similar Earthquake Signals." Bulletin of the Seismological Society of America 109, no. 4 (June 25, 2019): 1451–68. http://dx.doi.org/10.1785/0120190006.

Full text
Abstract:
Abstract Seismology has continuously recorded ground‐motion spanning up to decades. Blind, uninformed search for similar‐signal waveforms within this continuous data can detect small earthquakes missing from earthquake catalogs, yet doing so with naive approaches is computationally infeasible. We present results from an improved version of the Fingerprint And Similarity Thresholding (FAST) algorithm, an unsupervised data‐mining approach to earthquake detection, now available as open‐source software. We use FAST to search for small earthquakes in 6–11 yr of continuous data from 27 channels over an 11‐station local seismic network near the Diablo Canyon nuclear power plant in central California. FAST detected 4554 earthquakes in this data set, with a 7.5% false detection rate: 4134 of the detected events were previously cataloged earthquakes located across California, and 420 were new local earthquake detections with magnitudes −0.3≤ML≤2.4, of which 224 events were located near the seismic network. Although seismicity rates are low, this study confirms that nearby faults are active. This example shows how seismology can leverage recent advances in data‐mining algorithms, along with improved computing power, to extract useful additional earthquake information from long‐duration continuous data sets.
APA, Harvard, Vancouver, ISO, and other styles
8

Reynolds, Robert I. "The Role of Object-Hypotheses in the Organization of Fragmented Figures." Perception 14, no. 1 (February 1985): 49–52. http://dx.doi.org/10.1068/p140049.

Full text
Abstract:
The effect of an object-hypothesis on the organization of fragmented figures was investigated by varying instructions given prior to stimulus presentation. One group was uninformed as to the possibility of seeing a figure; a second group was instructed that it is possible to see a meaningful object; a third group was further instructed as to which class of object was presented. It was found that, in order to achieve organization of fragmented figures, the observer must have knowledge that a meaningful object may be integrated from the fragments. Knowledge of the class of object, while increasing the likelihood of recognition, does not significantly decrease search time.
APA, Harvard, Vancouver, ISO, and other styles
9

Auster, Sarah, and Piero Gottardi. "Competing mechanisms in markets for lemons." Theoretical Economics 14, no. 3 (2019): 927–70. http://dx.doi.org/10.3982/te2921.

Full text
Abstract:
We study directed search equilibria in a decentralized market with adverse selection, where uninformed buyers post general trading mechanisms and informed sellers select one of them. We show that this has differing and significant implications with respect to the traditional approach, based on bilateral contracting between the parties. In equilibrium, all buyers post the same mechanism and low‐quality sellers receive priority in any meeting with a buyer. Also, buyers make strictly higher profits with low‐ than with high‐type sellers. When adverse selection is severe, the equilibrium features rationing and is constrained inefficient. Compared to the equilibrium with bilateral contracting, the equilibrium with general mechanisms yields a higher surplus for most, but not all, parameter specifications.
APA, Harvard, Vancouver, ISO, and other styles
10

Kergosien, Yannick Louis. "Distance-driven adaptive trees in biological metric spaces: uninformed accretion does not prevent convergence." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 367, no. 1908 (December 13, 2009): 4967–86. http://dx.doi.org/10.1098/rsta.2009.0146.

Full text
Abstract:
We present several variants of a stochastic algorithm which all evolve tree-structured sets adapted to the geometry of general target subsets in metric spaces, and we briefly discuss their relevance to biological modelling. In all variants, one repeatedly draws random points from the target (step 1), each time selecting from the tree to be grown the point which is closest to the point just randomly drawn (step 2), then adding to the tree a new point in the vicinity of that closest point (step 3 or accretion step). The algorithms differ in their accretion rule, which can use the position of the target point drawn, or not. The informed case relates to the early behaviour of self-organizing maps that mimic somatotopy. It is simple enough to be studied analytically near its branching points, which generally follow some unsuccessful bifurcations. Further modifying step 2 leads to a fast version of the algorithm that builds oblique binary search trees, and we show how to use it in high-dimensional spaces to address a problem relevant to interventional medical imaging and artificial vision. In the case of an uninformed accretion rule, some adaptation also takes place, the behaviour near branching points is computationally very similar to the informed case, and we discuss its interpretations within the Darwinian paradigm.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Uninformed search"

1

Žlebek, Petr. "Hra Sokoban a umělá inteligence." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2021. http://www.nusl.cz/ntk/nusl-442845.

Full text
Abstract:
The thesis is focused on solving the Sokoban game using artificial intelligence algorithms. The first part of the thesis describes the Sokoban game, state space and selected state space search methods. In the second part selected methods were implemented and graphic user interface was created in the Python environment. Comparative experiments were executed in the final part.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Uninformed search"

1

Rintanen, Jussi. "Heuristic Planning with SAT: Beyond Uninformed Depth-First Search." In AI 2010: Advances in Artificial Intelligence, 415–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17432-2_42.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chandra-Mouli, Venkatraman, and Sheila Vipul Patel. "Mapping the Knowledge and Understanding of Menarche, Menstrual Hygiene and Menstrual Health Among Adolescent Girls in Low- and Middle-Income Countries." In The Palgrave Handbook of Critical Menstruation Studies, 609–36. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-0614-7_46.

Full text
Abstract:
Abstract This review aims to answer the following questions: (1) how knowledgeable are adolescent girls in low- and middle-income countries (LMIC) about menstruation and how prepared are they for reaching menarche, (2) who are their sources of information regarding menstruation, (3) how well do the adults around them respond to their information needs, (4) what negative health and social effects do adolescents experience as a result of menstruation, and (5) how do adolescents respond when they experience these negative effects and what practices do they develop as a result? Using a structured search strategy, articles that investigate young girls’ preparedness for menarche, knowledge of menstruation, and practices surrounding menstrual hygiene in LMIC were identified. A total of 81 studies published in peer-reviewed journals between the years 2000 and 2015 that describe the experiences of adolescent girls from 25 different countries were included. Adolescent girls in LMIC are often uninformed and unprepared for menarche. Information is primarily obtained from mothers and other female family members who are not necessarily well equipped to fill gaps in girls’ knowledge. Exclusion and shame lead to misconceptions and unhygienic practices during menstruation. Rather than seek medical consultation, girls tend to miss school, self-medicate, and refrain from social interaction. Also problematic is that relatives and teachers are often not prepared to respond to the needs of girls. LMIC must recognize that lack of preparation, knowledge, and poor practices surrounding menstruation are key impediments not only to girls’ education, but also to self-confidence and personal development. In addition to investment in private latrines with clean water for girls in both schools and communities, countries must consider how to improve the provision of knowledge and understanding and how to better respond to the needs of adolescent girls.
APA, Harvard, Vancouver, ISO, and other styles
3

Nilsson, Nils J. "Uninformed Search." In Artificial Intelligence: A New Synthesis, 129–38. Elsevier, 1998. http://dx.doi.org/10.1016/b978-0-08-049945-1.50014-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lazar, Alina. "Knowledge Discovery Using Heuristics." In Encyclopedia of Information Science and Technology, First Edition, 1752–56. IGI Global, 2005. http://dx.doi.org/10.4018/978-1-59140-553-5.ch308.

Full text
Abstract:
Uninformed or blind search, which processes and evaluates all nodes of a search space in the worst case, is not realistic for extracting knowledge from large data sets because of time constraints that are closely related to the dimension of the data. Generally, the search space increases exponentially with problem size, thereby limiting the size of problems that can realistically be solved using exact techniques such as exhaustive search. An alternative solution is represented by heuristic techniques, which can provide much help in areas where classical search methods failed.
APA, Harvard, Vancouver, ISO, and other styles
5

Dasgupta, P. "Efficient Searching in Peer-to-Peer Networks Using Agent-Enabled Ant Algorithms." In Handbook of Research on Nature-Inspired Computing for Economics and Management, 721–38. IGI Global, 2007. http://dx.doi.org/10.4018/978-1-59140-984-7.ch047.

Full text
Abstract:
In this chapter we describe a mechanism to search for resources in unstructured peer-to- peer (P2P) networks using ant algorithms implemented through software agents. Traditional resource search algorithms in P2P networks use an uninformed or blind search among the various nodes of the network. In contrast, the resource search algorithm described in this chapter performs an informed search using the ant-based heuristic. In our algorithm, ants, implemented as software agents, are created in response to a user’s resource search query. An ant reinforces the route that yields a successful search for directing ants in the future towards nodes with higher probability of locating resources. We describe and compare different reinforcement strategies used by ants to perform efficient resource search in P2P networks.
APA, Harvard, Vancouver, ISO, and other styles
6

O’Daniel, Thomas, and Teoh Say Yen. "The Game of Internet B2B." In Managing IT in Government, Business & Communities, 175–94. IGI Global, 2003. http://dx.doi.org/10.4018/978-1-93177-740-7.ch013.

Full text
Abstract:
Game theory accepts the expected utility hypothesis and reduces roles to the “informed” and the “uninformed” player in order to facilitate the process of constructing mathematical models. When quality is known to the seller, but not to the buyer, private markets can be modeled as a screening game, and public exchanges as a signaling game. In a private market, the buyer moves first by revealing acceptable quality. In a public exchange, the seller moves first by publicizing product information. Adoption of the technology will ultimately depend on perception of the game and payoffs relative to risks. Price competition is a significant negative externality, and opportunistic representations a real danger. When search costs are low, scope for differentiation limited, and information about quality is incomplete or imperfect, the conditions for a lemon’s market are fulfilled. A focus on commodities, global reach, and building a positive brand image for Internet business-to-business (B2B) in general should prove effective.
APA, Harvard, Vancouver, ISO, and other styles
7

Lim, Kai Li, Kah Phooi Seng, Lee Seng Yeong, and Li-Minn Ang. "RFID and Dead-Reckoning-Based Indoor Navigation for Visually Impaired Pedestrians." In Handbook of Research on Recent Developments in Intelligent Communication Application, 380–96. IGI Global, 2017. http://dx.doi.org/10.4018/978-1-5225-1785-6.ch015.

Full text
Abstract:
This chapter presents an indoor navigation solution for visually impaired pedestrians, which employs a combination of a radio frequency identification (RFID) tag array and dead-reckoning to achieve positioning and localisation. This form of positioning aims to reduce the deployment cost and complexity of pure RFID array implementations. This is a smartphone-based navigation system that leverages the new advancements of smartphone hardware to achieve large data handling and fast pathfinding. Users interact with the system through speech recognition and synthesis. This approach allows the system to be accessible to the masses due to the ubiquity of smartphones today. Uninformed pathfinding algorithms are implemented onto this system based on our previous study on the implementation suitability of uninformed searches. Testing results showed that this navigation system is suitable for use for the visually impaired pedestrians; and the pathfinding algorithms performed consistently according to our algorithm proposals.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Uninformed search"

1

Pooja, S., S. Chethan, and C. V. Arjun. "Analyzing uninformed search strategy algorithms in state space search." In 2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication (ICGTSPICC). IEEE, 2016. http://dx.doi.org/10.1109/icgtspicc.2016.7955277.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chiong, Raymond, Jofry Hadi Sutanto, and Wendy Japutra Jap. "A comparative study on informed and uninformed search for intelligent travel planning in Borneo Island." In 2008 International Symposium on Information Technology. IEEE, 2008. http://dx.doi.org/10.1109/itsim.2008.4631975.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

McGovern, Seamus M., and Surendra M. Gupta. "Uninformed and probabilistic distributed agent combinatorial searches for the unary NP-complete disassembly line balancing problem." In Optics East 2005, edited by Surendra M. Gupta. SPIE, 2005. http://dx.doi.org/10.1117/12.629121.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Uninformed search' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography