Results 1 to 10 of about 426,465 (119)
Searching for Intimacy, Searching for Deleuze [PDF]
Cultural Studies ↔ Critical Methodologies, 2021 In this article, the author is in Paris searching for Gilles Deleuze. She wants to become more intimate with him, spending slow time exploring his work. In her search for intimacy with Deleuze, she follows a map that she buys at a bouquiniste, and she chooses to take the roads toward an ontological conception of love, to an intimacy that blurs ...
openaire +2 more sources
Information Systems, 2019 Metric search is concerned with the efficient evaluation of queries in metric spaces. In general,a large space of objects is arranged in such a way that, when a further object is presented as a query, those objects most similar to the query can be efficiently found.
Connor R +3 more
openaire +6 more sources
Searching for connections: Data search, web search and literature search
, 2022 This presentation is given at the Research Data Alliance (RDA) 19th Plenary, a session organised by the RDA Data Discovery Paradigms Interest Group.
Gregory, Kathleen +6 more
openaire +1 more source
Constraints, 2011 The ability to model search in a constraint solver can be an essential asset for solving combinatorial problems. However, existing infrastructure for defining search heuristics is often inadequate. Either modeling capabilities are extremely limited or users are faced with a general-purpose programming language whose features are not tailored towards ...
Tom Schrijvers +4 more
openaire +6 more sources
Nuclear Physics B - Proceedings Supplements, 1992 The strong CP problem and its resolution through the existence of an axion are briefly reviewed. The constraints on the axion from accelerator searches, from the evolution of red giants and from supernova SN1987a combine to require $m_a < 3 \cdot 10^{-3}$ eV, where $m_a$ is the axion mass.
Department of Physics, University of Florida, Gainesville, FL 32611, USA ( host institution ) +1 more
openaire +3 more sources
Journal of the ACM, 1999 We introduce a search problem called “mutual search” where k agents, arbitrarily distributed over n sites, are required to locate one another by posing queries of the form “Anybody at site i ?”.
H.M. Buhrman (Harry) +5 more
openaire +4 more sources
Econometrica, 1985 This paper presents a general model of search in which the searcher maximizes the expected utility of search by choosing not only the number of periods of search but also the size of sample to be taken each period. Both no-recall and full-recall cases are allowed and the cost of search includes not only financial but also psychic cost.
Morgan, Peter, Manning, Richard
openaire +2 more sources
Transformation as Search [PDF]
, 2013 In model-driven engineering, model transformations are considered a key element to generate and maintain consistency between related models. Rule-based approaches have become a mature technology and are widely used in different application domains. However, in various scenarios, these solutions still suffer from a number of limitations that stem from ...
Kleiner, Mathias +2 more
openaire +3 more sources
Partitioning Search Spaces of a Randomized Search [PDF]
Fundamenta Informaticae, 2009 This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what is the best way to use the computers to solve the instance? Two approaches, simple distribution and search space partitioning as well as their combinations are investigated both
Niemelä Ilkka +2 more
openaire +3 more sources
An Analysis of Theories of Search and Search Behavior [PDF]
Proceedings of the 2015 International Conference on The Theory of Information Retrieval, 2015 Theories of search and search behavior can be used to glean insights and generate hypotheses about how people interact with retrieval systems. This paper examines three such theories, the long standing Information Foraging Theory, along with the more recently proposed Search Economic Theory and the Interactive Probability Ranking Principle. Our goal is
Leif Azzopardi, Guido Zuccon
openaire +3 more sources