466,653 Hits in 4.6 sec

Search algorithms in type theory

James L Caldwell, Ian P Gent, Judith Underwood
2000 Theoretical Computer Science  
In this paper, we take an abstract view of search by describing search procedures via particular kinds of proofs in type theory.  ...  This paper demonstrates a nontrivial application of the proofs-as-programs paradigm by applying the technique to the derivation of a sophisticated search algorithm; also, it shows the generality of the  ...  Our approach to the veriÿcation of search algorithms uses type theory to connect the algorithm to a proof.  ... 
doi:10.1016/s0304-3975(99)00170-x fatcat:v7uztpykane4ldbddjqyqe5usq

A Newton-Type Algorithm for Solving Problems of Search Theory

Liping Zhang
2013 Advances in Operations Research  
In the survey of the continuous nonlinear resource allocation problem, Patriksson pointed out that Newton-type algorithms have not been proposed for solving the problem of search theory in the theoretical  ...  In this paper, we propose a Newton-type algorithm to solve the problem. We prove that the proposed algorithm has global and superlinear convergence.  ...  Conclusions In this paper we have proposed a Newton-type algorithm to solve the problem of search theory. We have shown that the proposed algorithm has global and superlinear convergence.  ... 
doi:10.1155/2013/513918 fatcat:pdbkc4fyefbrnkestc2spekysy

Automating the design of algorithms [chapter]

Douglas R. Smith
1993 Lecture Notes in Computer Science  
The second part discusses the theory of algorithm design used in KIDS.  ...  We trace the use of KIDS in deriving a scheduling algorithm.  ...  After simplification we get the code in Figure 8 . Data Type Refinement Our next step is to choose implementations for the abstract data types in the algorithm.  ... 
doi:10.1007/3-540-57499-9_25 fatcat:ezbpogrnjvhmzkrwqwow2y7fee


2000 Theoretical Computer Science  
Recently, there has been a great deal of work on proof-search in type-theoretic lan-0304-3975/00/$ -see front matter c 2000 Elsevier Science B.V. All rights reserved.  ...  Preface Algorithmic proof-search is a fundamental enabling technology throughout computing science.  ...  The paper Search Algorithms in Type Theory applies this technique to the derivation of a sophisticated search algorithm.  ... 
doi:10.1016/s0304-3975(99)00168-1 fatcat:pw6ussamo5dobmb6ebviodz7gu

Algorithm theories and design tactics [chapter]

Douglas R. Smith, Michael R. Lowry
1989 Lecture Notes in Computer Science  
We illustrate this approach with recent work on the theory of global search algorithms [ 181 and briefly mention theories of divide-andconquer [ 163, local search [8, 9] , and other classes of algorithms  ...  We illustrate this approach with recent work on the theory of global search algorithms and briefly mention several others.  ...  More discussion of this hierarchy may be found in Section 7. Below we present a theory for the class of global search algorithms.  ... 
doi:10.1007/3-540-51305-1_23 fatcat:3gdjemkshve63mdbvosudpn554

Where the Earth is flat and 9/11 is an inside job: A comparative algorithm audit of conspiratorial information in web search results [article]

Aleksandra Urman, Mykola Makhortykh, Roberto Ulloa, Juhi Kulshrestha
2021 arXiv   pre-print
We address this gap by conducting a comparative algorithm audit to examine the distribution of conspiratorial information in search results across five search engines: Google, Bing, DuckDuckGo, Yahoo and  ...  Using a virtual agent-based infrastructure, we systematically collect search outputs for six conspiracy theory-related queries (flat earth, new world order, qanon, 9/11, illuminati, george soros) across  ...  Algorithm audits in the context of web search have been largely focused on how specific biases lead to distortions in search results (Bandy, 2021).  ... 
arXiv:2112.01278v2 fatcat:ofdfcdf56rbdtlqubzs7u4mpmm

Page 61 of Journal of Research and Practice in Information Technology Vol. 24, Issue 2 [page]

1992 Journal of Research and Practice in Information Technology  
of fundamental importance, since they form the basis for solving a wide range of other graph theory problems Parallel algorithms developed for different types of tree and graph searching problems are  ...  In the past, the study of graph theory algorithms has mostly been in an environ- ment based on sequential computation.  ... 

Formal Mathematics for Verifiably Correct Program Synthesis

1996 Logic Journal of the IGPL  
We demonstrate the advantages of using formal mathematics in support of program development systems through an example in which we formalize a strategy for deriving global search algorithms from formal  ...  The theorems serve as derived inference rules implementing the kernel of these methods in a flexible, safe, efficient and comprehensible way.  ...  In [28] it has been shown that well-founded global search theories satisfying the four axioms lead to provably correct global search algorithms of the above kind.  ... 
doi:10.1093/jigpal/4.1.75 fatcat:vmamr6swkbbetkwp4jrsjfy7ya

Automatically Finding Theory Morphisms for Knowledge Management [chapter]

Dennis Müller, Michael Kohlhase, Florian Rabe
2018 Lecture Notes in Computer Science  
To remedy this problem, we have developed a morphism finder algorithm that automates theory morphism discovery.  ...  As they induce new theorems in the target theory for any of the source theory, theory morphisms are high-value elements of a modular formal library.  ...  This lemma is the center of our search algorithm explained in Lemma 2 (Core Algorithm). Consider two constant declarations c and c ′ in theories Σ and Σ ′ .  ... 
doi:10.1007/978-3-319-96812-4_18 fatcat:llu3cu4cqjbdbi6e6udbknequa

Algorithm theories and design tactics

Douglas R. Smith, Michael R. Lowry
1990 Science of Computer Programming  
We illustrate this approach with recent work on the theory of global search algorithms and briefly mention several others.  ...  Several design tactics have been implemented in the KIM/CYPRESS system and have been used to semiautomatically derive many algorithms.  ...  can be inferred in abstract global search theory [18].  ... 
doi:10.1016/0167-6423(90)90025-9 fatcat:y3zx3y4lirc4hkcjf6jdtfetru

Quick-Skip Search Hybrid Algorithm for the Exact String Matching Problem

Mustafa Abdul Sahib Naser, Nur'Aini Abdul Rashid, Mohammed Faiz Aboalmaaly
2012 Journal of clean energy technologies  
The hybrid algorithm was tested using different types of standard data set.  ...  Thus, several string matching algorithms have been proposed and applied in many applications, information retrieval, editors, internet searching engines, firewall interception and searching nucleotide  ...  Fig. 1 . 1 Skip search shift in the hybrid algorithm International Journal of Computer Theory and Engineering Vol. 4, No. 2, April 2012 Fig. 2 . 2 Quick search shift in the hybrid algorithm IV.  ... 
doi:10.7763/ijcte.2012.v4.462 fatcat:v35nt5zum5gl7jjktyuehpfpde

Using the bottom clause and mode declarations in FOL theory revision from examples

Ana Luísa Duboc, Aline Paes, Gerson Zaverucha
2009 Machine Learning  
In this work the bottom clause and mode declarations are introduced in a first-order logic theory revision system aiming to improve the efficiency of the antecedent addition operation and, consequently  ...  Such an approach leads to a huge search space which dominates the cost of the revision process.  ...  The modifications in the theory are devised by the revision operators, which could be of two types.  ... 
doi:10.1007/s10994-009-5116-8 fatcat:ilqqjcb7m5hg5ih5igxrfzmhuu

Application of Self Controlling Software Approach to Reactive Tabu Search

Nilgun Fescioglu-Unver, Mieczyslaw M. Kokar
2008 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems  
In this paper the principle of self adaptation is applied to achieve a self controlling software. The software considered in this case is a heuristic search algorithm: the reactive tabu search.  ...  In reactive search algorithms, the behavior of the algorithm is evaluated and modified during the search. To improve self adaptation, two new strategies for reactive tabu search are introduced.  ...  There are several implementations of tabu search algorithm on QAP. One type of move that is mostly used in these algorithms is exchanging the location of two units [30, 4] .  ... 
doi:10.1109/saso.2008.16 dblp:conf/saso/Fescioglu-UnverK08 fatcat:p2v4vel625hk3mp4v77ymj3y5a

An Ordinal Optimization Theory-Based Algorithm for Solving the Optimal Power Flow Problem With Discrete Control Variables

S.-Y. Lin, Y.C. Ho, C.-H. Lin
2004 IEEE Transactions on Power Systems  
The approach of our ordinal optimization theory-based algorithm consists of three stages. First, select heuristically a large set of candidate solutions.  ...  Aiming for hard optimization problems, the ordinal optimization theory, in contrast to heuristic methods, guarantee to provide a top % solution among all with probability more than 0.95.  ...  field theory-based annealing algorithm [5] , evolutionary algorithm [16] , and the tabu search method [9] .  ... 
doi:10.1109/tpwrs.2003.818732 fatcat:cbxli4qndrad7kcac2v6omqwbu

Application of Graph Theory in Computer Science and Engineering

Rishi PalSingh, Vandana Vandana
2014 International Journal of Computer Applications  
This paper explores different concepts involved in graph theory and their applications in computer science to demonstrate the utility of graph theory.  ...  These applications are presented especially to project the idea of graph theory and to demonstrate its objective and importance in computer science engineering.  ...  The applications of graphs in image processing are: to find edge boundaries using graph search algorithms in segmentation.  To calculate he alignment of the picture  Finding mathematical constraints  ... 
doi:10.5120/18165-9025 fatcat:rithbe7s55b6xg7dnau6k7b2am
« Previous Showing results 1 — 15 out of 466,653 results