Search results for 'algorithm' (try it on Scholar)

1000+ found
Sort by:
  1. Kees van Deemter, Albert Gatt, Ielka van der Sluis & Richard Power (2011). Generation of Referring Expressions: Assessing the Incremental Algorithm. Cognitive Science 36 (5):799-836.score: 24.0
    A substantial amount of recent work in natural language generation has focused on the generation of ‘‘one-shot’’ referring expressions whose only aim is to identify a target referent. Dale and Reiter's Incremental Algorithm (IA) is often thought to be the best algorithm for maximizing the similarity to referring expressions produced by people. We test this hypothesis by eliciting referring expressions from human subjects and computing the similarity between the expressions elicited and the ones generated by algorithms. It turns (...)
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  2. Emiel Krahmer, Ruud Koolen & Mariët Theune (2012). Is It That Difficult to Find a Good Preference Order for the Incremental Algorithm? Cognitive Science 36 (5):837-841.score: 24.0
    In a recent article published in this journal (van Deemter, Gatt, van der Sluis, & Power, 2012), the authors criticize the Incremental Algorithm (a well-known algorithm for the generation of referring expressions due to Dale & Reiter, 1995, also in this journal) because of its strong reliance on a pre-determined, domain-dependent Preference Order. The authors argue that there are potentially many different Preference Orders that could be considered, while often no evidence is available to determine which is a (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  3. Bruno Mesz, Mariano Sigman & Marcos Trevisan (2012). A Composition Algorithm Based on Crossmodal Taste-Music Correspondences. Frontiers in Human Neuroscience 6.score: 24.0
    While there is broad consensus about the structural similarities between language and music, comparably less attention has been devoted to semantic correspondences between these two ubiquitous manifestations of human culture. We have investigated the relations between music and a narrow and bounded domain of semantics: the words and concepts referring to taste sensations. In a recent work, we found that taste words were consistently mapped to musical parameters. Bitter is associated with low-pitched and continuous music (legato), salty is characterized by (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  4. Kees van Deemter, Albert Gatt, Ielka van der Sluis & Richard Power (2012). Generation of Referring Expressions: Assessing the Incremental Algorithm. Cognitive Science 36 (5):799-836.score: 21.0
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  5. S. Dan Felsenthal & Moshé Machover (1992). Sequential Voting by Veto: Making the Mueller-Moulin Algorithm More Versatile. Theory and Decision 33 (3):223-240.score: 21.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  6. Susan Hanekon, Sue Berney, Brenda Morrow, George Ntoumenopoulos, Jennifer Paratz, Shane Patman & Quinette Louw (2011). The Validation of a Clinical Algorithm for the Prevention and Management of Pulmonary Dysfunction in Intubated Adults: A Synthesis of Evidence and Expert Opinion. Journal of Evaluation in Clinical Practice 17 (4):801-810.score: 21.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  7. Peter Juslin & Magnus Persson (2002). PROBabilities From EXemplars (PROBEX): A “Lazy” Algorithm for Probabilistic Inference From Generic Knowledge. Cognitive Science 26 (5):563-607.score: 21.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  8. Wolfgang Klimesch (2013). An Algorithm for the EEG Frequency Architecture of Consciousness and Brain Body Coupling. Frontiers in Human Neuroscience 7.score: 21.0
  9. Shuzhuo Li, Yinghui Chen, Haifeng Du & Marcus W. Feldman (2010). A Genetic Algorithm with Local Search Strategy for Improved Detection of Community Structure. Complexity 15 (4):53-60.score: 21.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  10. Matthias Müller-Hannemann & Stefan Schirra (eds.) (2010). Algorithm Engineering: Bridging the Gap Between Algorithm Theory and Practice. Springer.score: 20.0
    Driven by concrete applications, Algorithm Engineering complements theory by the benefits of experimentation and puts equal emphasis on all aspects arising during a cyclic solution process ranging from realistic modeling, design, analysis, ...
    Direct download  
     
    My bibliography  
     
    Export citation  
  11. Elżbieta Hajnicz (1996). Applying Allen's Constraint Propagation Algorithm for Non-Linear Time. Journal of Logic, Language and Information 5 (2):157-175.score: 20.0
    The famous Allen's interval relations constraint propagation algorithm was intended for linear time. Its 13 primitive relations define all the possible mutual locations of two intervals on the time-axis. In this paper an application of the algorithm for non-linear time is suggested. First, a new primitive relation is added. It is called excludes since an occurrence of one event in a certain course of events excludes an occurrence of the other event in this course. Next, new composition rules (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  12. Kees van Deemter, Albert Gatt, Ielka van der Sluis & Richard Power (2012). Assessing the Incremental Algorithm: A Response to Krahmer Et Al. Cognitive Science 36 (5):842-845.score: 20.0
    This response discusses the experiment reported in Krahmer et al.’s Letter to the Editor of Cognitive Science. We observe that their results do not tell us whether the Incremental Algorithm is better or worse than its competitors, and we speculate about implications for reference in complex domains, and for learning from ‘‘normal” (i.e., non-semantically-balanced) corpora.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  13. Peter Spirtes, An Anytime Algorithm for Causal Inference.score: 18.0
    The Fast Casual Inference (FCI) algorithm searches for features common to observationally equivalent sets of causal directed acyclic graphs. It is correct in the large sample limit with probability one even if there is a possibility of hidden variables and selection bias. In the worst case, the number of conditional independence tests performed by the algorithm grows exponentially with the number of variables in the data set. This affects both the speed of the algorithm and the accuracy (...)
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  14. Peter Spirtes, A Polynomial Time Algorithm for Determining Dag Equivalence in the Presence of Latent Variables and Selection Bias.score: 18.0
    if and only if for every W in V, W is independent of the set of all its non-descendants conditional on the set of its parents. One natural question that arises with respect to DAGs is when two DAGs are “statistically equivalent”. One interesting sense of “statistical equivalence” is “d-separation equivalence” (explained in more detail below.) In the case of DAGs, d-separation equivalence is also corresponds to a variety of other natural senses of statistical equivalence (such as representing the same (...)
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  15. Itamar Pitowsky, The Number of Elements in a Subset: A Grover-Kronecker Quantum Algorithm.score: 18.0
    In a fundamental paper [Phys. Rev. Lett. 78, 325 (1997)] Grover showed how a quantum computer can …nd a single marked object in a database of size N by using only O(pN ) queries of the oracle that identi…es the object. His result was generalized to the case of …nding one object in a subset of marked elements. We consider the following computational problem: A subset of marked elements is given whose number of elements is either M or K, M (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  16. Peter Spirtes, An Algorithm for Fast Recovery of Sparse Causal Graphs.score: 18.0
    Previous asymptotically correct algorithms for recovering causal structure from sample probabilities have been limited even in sparse graphs to a few variables. We describe an asymptotically correct algorithm whose complexity for fixed graph connectivity increases polynomially in the number of vertices, and may in practice recover sparse graphs with several hundred variables. From..
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  17. Varol Akman, A Simple and Efficient Haloed Line Algorithm for Hidden Line Elimination.score: 18.0
    An efficient algorithm, HALO, is given to compute As computer aided design (CAD) deals with more com- haloed line drawings of wire frame objects. (Haloed..
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  18. Carsten Lutz, Holger Sturm, Frank Wolter & Michael Zakharyaschev (2002). A Tableau Decision Algorithm for Modalized ALC with Constant Domains. Studia Logica 72 (2):199-232.score: 18.0
    The aim of this paper is to construct a tableau decision algorithm for the modal description logic K ALC with constant domains. More precisely, we present a tableau procedure that is capable of deciding, given an ALC-formula with extra modal operators (which are applied only to concepts and TBox axioms, but not to roles), whether is satisfiable in a model with constant domains and arbitrary accessibility relations. Tableau-based algorithms have been shown to be practical even for logics of rather (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  19. Mark A. Bedau, Optimal Formulation of Complex Chemical Systems with a Genetic Algorithm.score: 18.0
    We demonstrate a method for optimizing desired functionality in real complex chemical systems, using a genetic algorithm. The chemical systems studied here are mixtures of amphiphiles, which spontaneously exhibit a complex variety of self-assembled molecular aggregations, and the property optimized is turbidity. We also experimentally resolve the fitness landscape in some hyper-planes through the space of possible amphiphile formulations, in order to assess the practicality of our optimization method. Our method shows clear and significant progress after testing only 1 (...)
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  20. C. Gaucherel & S. Bérard (2011). Equation or Algorithm: Differences and Choosing Between Them. Acta Biotheoretica 59 (1):67-79.score: 18.0
    The issue of whether formal reasoning or a computing-intensive approach is the most efficient manner to address scientific questions is the subject of some considerable debate and pertains not only to the nature of the phenomena and processes investigated by scientists, but also the nature of the equation and algorithm objects they use. Although algorithms and equations both rely on a common background of mathematical language and logic, they nevertheless possess some critical differences. They do not refer to the (...)
    No categories
    Translate to English
    | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  21. Patrick Grim, Evolution of Communication with a Spatialized Genetic Algorithm.score: 18.0
    We extend previous work by modeling evolution of communication using a spatialized genetic algorithm which recombines strategies purely locally. Here cellular automata are used as a spatialized environment in which individuals gain points by capturing drifting food items and are 'harmed' if they fail to hide from migrating predators. Our individuals are capable of making one of two arbitrary sounds, heard only locally by their immediate neighbors. They can respond to sounds from their neighbors by opening their mouths or (...)
     
    My bibliography  
     
    Export citation  
  22. Alejandro López-Rousseau & Timothy Ketelaar (2006). Juliet: If They Do See Thee, They Will Murder Thee. A Satisficing Algorithm for Pragmatic Conditionals. Mind and Society 5 (1):71-77.score: 18.0
    In a recent Mind & Society article, Evans (2005) argues for the social and communicative function of conditional statements. In a related article, we argue for satisficing algorithms for mapping conditional statements onto social domains (Eur J Cogn Psychol 16:807–823,2004). The purpose of the present commentary is to integrate these two arguments by proposing a revised pragmatic cues algorithm for pragmatic conditionals.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  23. Ravi Santosh Arvapally & Xiaoqing (2013). Polarisation Assessment in an Intelligent Argumentation System Using Fuzzy Clustering Algorithm for Collaborative Decision Support. Argument and Computation 4 (3):181-208.score: 18.0
    We developed an on-line intelligent argumentation system which facilitates stakeholders in exchanging dialogues. It provides decision support by capturing stakeholders? rationale through arguments. As part of the argumentation process, stakeholders tend to both polarise their opinions and form polarisation groups. The challenging issue of assessing argumentation polarisation had not been addressed in argumentation systems until recently. Arvapally, Liu, and Jiang [(2012), ?Identification of Faction Groups and Leaders in Web-Based Intelligent Argumentation System for Collaborative Decision Support?, in Proceedings of International Conference (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  24. Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson & Dorothea Wagner, Algorithm Engineering (Dagstuhl Seminar 13391).score: 18.0
    This report documents the program and the outcomes of Dagstuhl Seminar 13391 "Algorithm Engineering". The algorithm engineering approach consists of a cycle of algorithm design, analysis, implementation, and experimental evaluation, with the aim of bridging the gap between theory and practice in the area of algorithms. This cycle of phases is driven by falsifiable hypotheses validated by experiments. Moreover, real-world instances often have direct impact on this cycle since they often expose modeling and analysis shortcomings. Algorithm (...)
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  25. Shane Harwood & Richard Scheines, Genetic Algorithm Search Over Causal Models.score: 18.0
    Shane Harwood and Richard Scheines. Genetic Algorithm Search Over Causal Models.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  26. Carl van Walraven & Vivek Goel (2002). The Effect of a Hepatitis Serology Testing Algorithm on Laboratory Utilization. Journal of Evaluation in Clinical Practice 8 (3):327-332.score: 17.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  27. Qingfu Zhang (2004). On the Convergence of a Factorized Distribution Algorithm with Truncation Selection. Complexity 9 (4):17-23.score: 17.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  28. Kees van Deemter, Albert Gatt, Ielka van der Sluis & Richard Power (2012). Assessing the Incremental Algorithm: A Response to Krahmer Et Al. Cognitive Science 36 (5):842-845.score: 17.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  29. William E. Seager (2003). Yesterday's Algorithm: Penrose and the Godel Argument. Croatian Journal of Philosophy 3 (9):265-273.score: 16.0
    Roger Penrose is justly famous for his work in physics and mathematics but he is _notorious_ for his endorsement of the Gödel argument (see his 1989, 1994, 1997). This argument, first advanced by J. R. Lucas (in 1961), attempts to show that Gödel’s (first) incompleteness theorem can be seen to reveal that the human mind transcends all algorithmic models of it1. Penrose's version of the argument has been seen to fall victim to the original objections raised against Lucas (see Boolos (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  30. William J. Rapaport & Michael W. Kibby, Contextual Vocabulary Acquisition: From Algorithm to Curriculum.score: 15.0
    Deliberate contextual vocabulary acquisition (CVA) is a reader’s ability to figure out a (not the) meaning for an unknown word from its “context”, without external sources of help such as dictionaries or people. The appropriate context for such CVA is the “belief-revised integration” of the reader’s prior knowledge with the reader’s “internalization” of the text. We discuss unwarranted assumptions behind some classic objections to CVA, and present and defend a computational theory of CVA that we have adapted to a new (...)
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  31. A. G. Baker, Irina Baetu & Robin A. Murphy (2009). Propositional Learning is a Useful Research Heuristic but It is Not a Theoretical Algorithm. Behavioral and Brain Sciences 32 (2):199-200.score: 15.0
    Mitchell et al.'s claim, that their propositional theory is a single-process theory, is illusory because they relegate some learning to a secondary memory process. This renders the single-process theory untestable. The propositional account is not a process theory of learning, but rather, a heuristic that has led to interesting research.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  32. Daniel C. Dennett, Evolution as Algorithm.score: 15.0
    John Locke offered what he considered a sound a priori argument that Mind must come first, must be the original Cause, not merely an Effect: If, then, there must be something eternal, let us see what sort of Being it must be. And to that it is very obvious to Reason, that it must necessarily be a cogitative Being. For it is as impossible to conceive that ever bare incogitative Matter should produce a thinking intelligent Being, as that nothing should (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  33. S. Kamal Abdali (1976). An Abstraction Algorithm for Combinatory Logic. Journal of Symbolic Logic 41 (1):222-224.score: 15.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  34. M. W. Bunder (1990). Some Improvements to Turner's Algorithm for Bracket Abstraction. Journal of Symbolic Logic 55 (2):656-669.score: 15.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  35. Thomas Donaldson (forthcoming). An Ethical Algorithm. The Ruffin Series in Business Ethics:101-106.score: 15.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  36. William Seager (2003). Yesterday's Algorithm. Croatian Journal of Philosophy 3 (3):265-273.score: 15.0
    Roger Penrose is infamous for defending aversion of John Lucas’s argument that Gödel’s incompleteness results show that the mind cannot be mechanistically (or, today, computationally) explained. Penrose’s argument has been subjected to a number of criticisms which, though correct as far as they go, leave open some peculiar and troubling features of the appeal to Gödel’s theorem. I try to reveal these peculiarities and develop a new criticism of the Penrose argument.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  37. Robert Binkley & Romane Clark (1967). A Cancellation Algorithm for Elementary Logic. Theoria 33 (2):79-97.score: 15.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  38. Arthur W. Burks (1980). Man: Sign or Algorithm? A Rhetorical Analysis of Peirce's Semiotics. Transactions of the Charles S. Peirce Society 16 (4):279 - 292.score: 15.0
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  39. Philip Hanson (2001). Darwin's Algorithm, Natural Selective History, and Intentionality Naturalized. Canadian Journal of Philosophy 31 (Supplement):53-83.score: 15.0
  40. R. W. House & T. Rado (1965). A Generalization of Nelson's Algorithm for Obtaining Prime Implicants. Journal of Symbolic Logic 30 (1):8-12.score: 15.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  41. Sauro Tulipani (1985). An Algorithm to Determine, for Any Prime P, a Polynomial-Sized Horn Sentence Which Expresses "the Cardinality is Not P". Journal of Symbolic Logic 50 (4):1062-1064.score: 15.0
    Given a prime p, we exhibit a Horn sentence H p which expresses "the cardinality is not p" and has size O(p 5 log p).
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  42. Robert Binkley & Romane Clark (1968). A Cancellation Algorithm Corrected. Theoria 34 (1):85-85.score: 15.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  43. Shande Chen & James E. Laughlin (2009). MRI Algorithm for Medical Necessity for Auto Accident Injured Patients. Journal of Evaluation in Clinical Practice 15 (1):189-194.score: 15.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  44. Mohammad Taghi Rezvan, Ali Zeinal Hamadani & Seyed Reza Hejazi (forthcoming). An Exact Feature Selection Algorithm Based on Rough Set Theory. Complexity:n/a-n/a.score: 15.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  45. Lou van den Dries & Yiannis N. Moschovakis (2004). Is the Euclidean Algorithm Optimal Among its Peers? Bulletin of Symbolic Logic 10 (3):390-418.score: 15.0
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  46. E. M. Fels (1962). Review: V. S. Koroluk, On the Concept of Address Algorithm. [REVIEW] Journal of Symbolic Logic 27 (3):366-366.score: 15.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  47. Roberto Salguero-Goacute (forthcoming). A Genetic Algorithm with Local Search Strategy for Improved Detection of Community Structure. Complexity.score: 15.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  48. D. A. Turner (1979). Another Algorithm for Bracket Abstraction. Journal of Symbolic Logic 44 (2):267-270.score: 15.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  49. David H. Ackley, Geoffrey E. Hinton & Terrence J. Sejnowski (1985). A Learning Algorithm for Boltzmann Machines. Cognitive Science 9 (1):147-169.score: 15.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  50. Haifeng Du, Marcus W. Feldman, Shuzhuo Li & Xiaoyi Jin (2007). An Algorithm for Detecting Community Structure of Social Networks Based on Prior Knowledge and Modularity. Complexity 12 (3):53-60.score: 15.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000