Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

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 “algorithms”

ment and Reconfiguraation Algorithms Algorithms Algorithms

Gareth Nicholls, Derrick G. Kourie, Tinus Strauss · 2009

This study examines the effects of location inaccuracies on two movement-assisted Voronoi-based sensor deployment and reconfiguration algorithms, VEC and VOR, due to Wang et al. For the purposes of examining the extent to which the deployment and reconfiguration algorithms are capable of reducing coverage holes, a simulator environment was set up, using a custom-designed simulation tool. By integrating the environment with that of a GIS application, real-world distance and scaling can be applied, allowing the assessment of the algorithms to be performed in a virtual world mimicking that of a real-world deployment. The simulation results suggest the VOR algorithm is reasonably robust if the location inaccuracies are somewhat lower than the sensing distance, and also if a high degree of inaccuracy is limited to a relatively small percentage of the nodes. The VEC algorithm is considerably less robust, but prevents nodes from drifting beyond the boundaries in the case of large inaccuracies.

Cited by 0

BASIC ALGORITHMS LEARNING ALGORITHMS

Irina Konstantinovna Egorova · Economy Business Computer science · 2016

Algorithmic (programming) – core module of computer science, both theoretically and practically important, but also difficult. It is important to develop and apply didactic and computer software algorithms, software. In the work methods of the theory of algorithms, programming and didactics developed a system of algorithms and supporting computer system for the development, programming typical tasks processing different data structures

Cited by 0

algorithms, Analysis of algorithms

Changbo Chen, Bican Xia, James H. Davenport et al. · 2012

This article is a continuation of our earlier work [3], which introduced triangular decompositions of semi-algebraic systems and algorithms for computing them. Our new contributions include theoretical results based on which we obtain practical improvements for these decomposition algorithms. We exhibit new results on the theory of border polynomials of parametric semi-algebraic systems: in particular a geometric characterization of its“true boundary”(Definition 2). In order to optimize these algorithms, we also propose a technique, that we call relaxation, which can simplify the decomposition process and reduce the number of redundant components in the output. Moreover, we present procedures for basic set-theoretical operations on semi-algebraic sets represented by triangular decomposition. Experimentation confirms the effectiveness of our techniques. Categories andSubject Descriptors

Cited by 0

Evolutionary algorithms. Evolutionary Algorithms

2009

Crucial to an Evolutionary Algorithm’s performance is its selection scheme. We mathematically investigate the relation between polynomial rank and probabilistic tournament methods which are (respectively) generalisations of the popular linear ranking and tournament selection schemes. We show that every probabilistic tournament is equivalent to a unique polynomial rank scheme. In fact, we derived explicit operators for translating between these two types of selection. Of particular importance is that most linear and most practical quadratic rank schemes are probabilistic tournaments.

Cited by 0

LANDSCAPE ALGORITHMS AS ACTIVITY ALGORITHMS

Виктория Александровна Золотарева · 2023

В статье раскрывается возможность адаптации обучающихся к новому образовательному стандарту при построении методологической основы образовательного процесса с учетом введения новых ФГОС, в которых наряду с предметными результатами, ключевыми становятся понятия метапредметных связей и функциональной грамотности. The article reveals the possibility of adapting students to the new educational standard when building the methodological basis of the educational process, taking into account the introduction of new Federal State Educational Standards, in which, along with subject results, the concepts of meta-subject relations and functional literacy become key.

Cited by 0

Algorithms General Terms Algorithms, Theory

James C. Beaumont, Russell J. Bradford, James H. Davenport et al. · 2008

Given an elementary function with algebraic branch cuts, we show how to decide which sheet of the associated Riemann surface we are on at any given point. We do this by establishing a correspondence between the Cylindrical Algebraic Decomposition (CAD) of the complex plane defined by the branch cuts and a finite subset of sheets of the Riemann surface. The key advantage is that we no longer have to deal with the difficult ‘constant problem’.

Cited by 0

Advanced Algorithms: On-Line Algorithms

Lecturer Michel, Michel X. Goemans · 1994

Introduction The first topic we will cover in this course is on-line algorithms. The concept of online algorithms has been around for quite some time (it was for example present in the seventies in the bin packing literature, see [13, 20]), but it has been a fairly hot research area since the publication of the landmark paper by Sleator and Tarjan [19] in 1985. Typically when we solve problems and design algorithms we assume that we know all the data a priori. However in many practical situations this may not be true and rather than have the input in advance it may be presented to us as we proceed. We give below some examples to motivate the topic of on-line algorithms. 1.1 Investment Problem Consider an investor with a given sum of money which he wishes to invest so as to maximize his gain at the end of a specified period of time. He has a variety of options: he may keep funds in a money market account, he may buy certificates

Cited by 0

Algorithms

William F. Ford, David C. Stapleton · Numerical Linear Algebra with Applications · 2025

Cited by 0

Algorithms.

Cristian Berceanu (22881571), Francesco Bertolotti (17403767), Nadia Arshad (22881574) et al. · Figshare · 2025

Definitions and algorithms specific to the implementation fo the two ABMs. (PDF)

Cited by 0Open access

Algorithms

Jesús Vilares · 2008

Information Retrieval systems are limited by the linguistic variation of language. The use of Natural Language Processing techniques to manage this problem has been studied for a long time, but mainly focusing on English. In this paper we deal with European languages, taking Spanish as a case in point. Two different sources of syntactic information, queries and documents, are studied in order to increase the performance of Information Retrieval systems.

Cited by 0