Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “SIMPLE algorithm”
Jozef Varga, Marek Sukop · Applied Mechanics and Materials · 2016
This article describes algorithm for patterns recognition of application for dual arm robot, android device and camera system. As first was create android application for getting information from computer via Bluetooth. Computer is using for image processing from external camera and then send image of dice to android devices and show on screen score of dice.
Cited by 1
Abdelhakim Artiba, V. V. Emelyanov, Serguei Iassinovski · 1998
Cited by 0
W. J. Whiten · The ANZIAM Journal · 2009
Abstract It is shown that a simple deduction engine can be developed for a propositional logic that follows the normal rules of classical logic in symbolic form, but the description of what is known about a proposition uses two numeric state variables that conveniently describe unknown and inconsistent, as well as true and false. Partly true and partly false can be included in deductions. The multi-valued logic is easily understood as the state variables relate directly to true and false. The deduction engine provides a convenient standard method for handling multiple or complicated logical relations. It is particularly convenient when the deduction can start with different propositions being given initial values of true or false. It extends Horn clause based deduction for propositional logic to arbitrary clauses. The logic system used has potential applications in many areas. A comparison with propositional logic makes the paper self-contained.
Cited by 0Open access
T. W. Sze, Yixiong Yang · IEEE Transactions on Pattern Analysis and Machine Intelligence · 1981
Two similarity measures between strings are proposed. This correspondence also describes an experiment performed to illustrate the inadequacy of a commonly used measure.
Cited by 12
Kenny Erleben, Knud Henriksen · 2008
The daily work with mesh data structures can be a painful experience. Topological inconsistency and digital mockup is part of daily life and often unwanted in both visualization, collision detection and animation. In this paper we focus on the particular problem of patching (also termed capping) an open boundary of a mesh after it has been cut by a plane. The paper describes an algorithm for planar patching and outlines an implementation. The novel contribution is a divide and conquer algorithm working on a spatial hierarchical data structure of the cutting boundaries of the mesh.
Cited by 0
Janne Aikio, Petri Mähönen · The Astrophysical Journal · 1998
We have developed a new automatic void-searching algorithm for three-dimensional redshift surveys and N-body simulations. We strictly define the condition that is called a void. This definition is used to make a new and automatic algorithm that finds voids from particle distributions. We introduce our algorithm and show with test simulations that it is a robust tool for automatic void searching and void statistics calculations.
Cited by 48Open access
John R. Rice, Calvin J. Ribbens, William A. Ward · ACM Transactions on Mathematical Software · 1984
A macroprocessor is a tool for substituting values from a symbol table into a text. Thus, if DATE has the value 'JULY 10
Cited by 5Open access
Daniel Král͏̌, Pavel Neogrády, Vladimı́r Kellö · Computer Physics Communications · 1995
Cited by 2
Philip Wadler · 2007
Cited by 0
Log Term, Eyal Kushilevitz · 1996
this paper appeared in the proceedings of COLT`96. This research was supported by Technion V.P.R. Fund 120-872 and by Japan Technion Society Research Fund.
Cited by 0
Raimi Ayinde Rufai, Dana Richards · arXiv (Cornell University) · 2017
Given a set of $n$ points $P$ in the plane, the first layer $L_1$ of $P$ is formed by the points that appear on $P$'s convex hull. In general, a point belongs to layer $L_i$, if it lies on the convex hull of the set $P \setminus \bigcup_{j<i></i>
Cited by 1Open access
Mladen Nikolić, Filip Marić, Predrag Janičić · arXiv (Cornell University) · 2011
The importance of algorithm portfolio techniques for SAT has long been noted, and a number of very successful systems have been devised, including the most successful one --- SATzilla. However, all these systems are quite complex (to understand, reimplement, or modify). In this paper we propose a new algorithm portfolio for SAT that is extremely simple, but in the same time so efficient that it outperforms SATzilla. For a new SAT instance to be solved, our portfolio finds its k-nearest neighbors from the training set and invokes a solver that performs the best at those instances. The main distinguishing feature of our algorithm portfolio is the locality of the selection procedure --- the selection of a SAT solver is based only on few instances similar to the input one.
Cited by 0Open access
L. Poladian · Optics Letters · 2000
Get PDF Email Share Share with Facebook Tweet This Post on reddit Share with LinkedIn Add to CiteULike Add to Mendeley Add to BibSonomy Get Citation Copy Citation Text L. Poladian, "Simple grating synthesis algorithm: errata," Opt. Lett. 25, 1400-1400 (2000) Export Citation BibTex Endnote (RIS) HTML Plain Text Citation alert Save article
Cited by 7
Cyril Allauzen, Mathieu Raffinot · Journal of Algorithms · 2000
Cited by 22
Keith D. Cooper, Timothy J. Harvey, Ken Kennedy · 2001
The problem of finding the dominators in a control-flow graph has a long history in the literature. The original algorithms su#ered from a large asymptotic complexity but were easy to understand. Subsequent work improved the time bound, but generally sacrificed both simplicity and ease of implementation. This paper returns to a simple formulation of dominance as a global data-flow problem. Some insights into the natureofdominance lead to an implementation of an O(N )algorithm that runs faster, in practice, than the classic Lengauer-Tarjan algorithm, which has a timebound of O(E log(N)). We compare the algorithm to Lengauer-Tarjan because it is the best known and most widely used of the fast algorithms for dominance. Working from the same implementationinsights,wealso rederive (from earlier work on control dependence by Ferrante, et al.)amethodforcalculating dominance frontiers that we show is faster than the original algorithm by Cytron, et al. The aim of this paper is not to present a new algorithm, but, rather, to make an argument based on empirical evidence that algorithms with discouraging asymptotic complexities can be faster in practice than those more commonly employed. We show that, in some cases, careful engineering of simple algorithms can overcome theoretical advantages, even when problems grow beyond realistic sizes. Further, we argue that the algorithms presented herein are intuitive and easily implemented, making them excellent teaching tools.
Cited by 0
M. Mar Albà, Roman A. Laskowski, John M. Hancock · Bioinformatics · 2002
The program is available on request or online at http://www.biochem.ucl.ac.uk/bsm/SIMPLE.
Cited by 69Open access
Xi Chen · 2013
In view of the problem that Monkey algorithm cannot acquire solutions exactly in solving global optimization and spend a lot of time in computation,this paper designed a hybrid algorithm based on monkey algorithm and simple method which combine with the searching idea of traditional simple method.The algorithm improves the calculation accuracy and speeds up monkey algorithm converge speed in a certain degree.The simulation results show that the improved monkey-simple hybrid algorithm has strong advantage in function testing.The results are more close to the theory optimal solution.
Cited by 1
Stephan Dempe, Joydeep Duta, Tanushree Pandit et al. · ArXiv.org · 2025
In this article we intend to develop a simple and implementable algorithm for minimizing a convex function over the solution set of another convex optimization problem. Such a problem is often referred to as a simple bilevel programming (SBP) problem. One of the key features of our algorithm is that we make no assumption on the diferentiability of the upper level objective, though we will assume that the lower level objective is smooth. Another key feature of the algorithm is that it does not assume that the lower level objective has a Lipschitz gradient, which is a standard assumption in most of the well-known algorithms for this class of problems. We present the convergence analysis and also some numerical experiments demonstrating the efectiveness of the algorithm.
Cited by 0Open access
Min Chih Lin, Francisco J. Soulignac, Jayme L. Szwarcfiter · 2009
A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, and if some point of C is not covered by any arc then M is an interval model. A (proper) (interval) circulararc graph is the intersection graph of a (proper) (interval) circular-arc model. Circular-arc graphs and their subclasses have been the object of a great deal of attention in the literature. Linear time recognition algorithms have been described both for the general class and for some of its subclasses. For the isomorphism problem, there exists a polynomial time algorithm for the general case, and a linear time algorithm for interval graphs. In this work we develop a linear time algorithm for the isomorphism problem in proper circular-arc graphs, based on uniquely encoding a proper circular-arc model. Our method relies on results about uniqueness of certain PCA models, developed by Deng, Hell and Huang in [6]. The algorithm is easy to code and uses only basic tools available in almost every programming language.
Cited by 0
Hugo Gruson · 2021
Cited by 0Open access