Search results for "Algorithm"

showing 10 items of 4887 documents

An affine scaling method using a class of differential barrier functions: primal approach

2020

International audience; In this paper we propose a family of affine scaling interior point algorithms, called galpv4, using a primal approach, based on a large class of differential barrier functions. We show that these algorithms are in fact an extension and generalization of the classical affine scaling algorithm based on the well-known log barrier function. After carrying out a complete convergence analysis, we select some of these algorithms for comparison with the classical affine scaling algorithm, performed with the help of the familiar Netlib test set.

Large classconcave gaugeClass (set theory)Pure mathematics021103 operations researchControl and Optimizationinterior point methodsApplied Mathematicsdifferential barrier0211 other engineering and technologies02 engineering and technologyManagement Science and Operations Research01 natural sciencesprimal algorithm010101 applied mathematicsAffine scalinglinear programs[MATH]Mathematics [math]0101 mathematicsInterior point methodDifferential (mathematics)MathematicsOptimization
researchProduct

DIAMIN: a software library for the distributed analysis of large-scale molecular interaction networks

2022

AbstractBackgroundHuge amounts of molecular interaction data are continuously produced and stored in public databases. Although many bioinformatics tools have been proposed in the literature for their analysis, based on their modeling through different types of biological networks, several problems still remain unsolved when the problem turns on a large scale.ResultsWe propose , that is, a high-level software library to facilitate the development of applications for the efficient analysis of large-scale molecular interaction networks. relies on distributed computing, and it is implemented in Java upon the framework Apache Spark. It delivers a set of functionalities implementing different ta…

Large scale networksDatabases FactualApplied MathematicsBiological networksComputational BiologyBiochemistryBig data analyticsComputer Science ApplicationsStructural BiologyMolecular interactionsMolecular BiologySoftwareAlgorithmsGene Library
researchProduct

EXAFS study of hydrogen intercalation into ReO 3 using the evolutionary algorithm.

2014

In this study we have investigated the influence of hydrogen intercalation on the local atomic structure of rhenium trioxide using a new approach to EXAFS data analysis, based on the evolutionary algorithm (EA). The proposed EA-EXAFS method is an extension of the conventional reverse Monte Carlo approach but is computationally more efficient. It allows one to perform accurate analysis of EXAFS data from distant coordination shells, taking into account both multiple-scattering and disorder (thermal and static) effects. The power of the EA-EXAFS method is first demonstrated on an example of the model system, pure ReO3, and then it is applied to an in situ study of hydrogen bronze HxReO3 upon …

Lattice dynamicsExtended X-ray absorption fine structureHydrogenIntercalation (chemistry)Analytical chemistryEvolutionary algorithmchemistry.chemical_elementReverse Monte CarloCondensed Matter PhysicsCondensed Matter::Materials Sciencechemistry.chemical_compoundRhenium trioxidechemistryChemical physicsCondensed Matter::SuperconductivityThermalGeneral Materials ScienceJournal of physics. Condensed matter : an Institute of Physics journal
researchProduct

Layout algorithms of graph-like diagrams for GRADE windows graphic editors

1996

We propose a set of layout operations ensuring flexible and convenient interactive editing of communication diagrams and nested entity-relationship models having textual labels on connections. The set includes several procedures for incremental diagram layout. Tools for fully automatic layout and for direct manual painting of graphic primitives are also integrated in a single system. In this way we have filled to some extent the gap between both extremal levels of editing.

Layout algorithmPaintingComputer scienceComputer graphics (images)Fully automaticGraph (abstract data type)Interactive editing
researchProduct

Leader election and local identifiers for three‐dimensional programmable matter

2020

International audience; In this paper, we present two deterministic leader election algorithms for programmable matter on the face-centered cubic grid. The face-centered cubic grid is a 3-dimensional 12-regular infinite grid that represents an optimal way to pack spheres (i.e., spherical particles or modules in the context of the programmable matter) in the 3-dimensional space. While the first leader election algorithm requires a strong hypothesis about the initial configuration of the particles and no hypothesis on the system configurations that the particles are forming, the second one requires fewer hypothesis about the initial configuration of the particles but does not work for all pos…

Leader electionComputer Networks and CommunicationsComputer science[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciences02 engineering and technology[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM][INFO] Computer Science [cs]Computer securitycomputer.software_genre01 natural sciencesComputer Science ApplicationsTheoretical Computer ScienceIdentifierProgrammable matter[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]Computational Theory and Mathematics010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingcomputerSoftware
researchProduct

A formal proof of the e-optimality of discretized pursuit algorithms

2015

Learning Automata (LA) can be reckoned to be the founding algorithms on which the field of Reinforcement Learning has been built. Among the families of LA, Estimator Algorithms (EAs) are certainly the fastest, and of these, the family of discretized algorithms are proven to converge even faster than their continuous counterparts. However, it has recently been reported that the previous proofs for ??-optimality for all the reported algorithms for the past three decades have been flawed. We applaud the researchers who discovered this flaw, and who further proceeded to rectify the proof for the Continuous Pursuit Algorithm (CPA). The latter proof examines the monotonicity property of the proba…

Learning automataDiscretizationInequalityBasis (linear algebra)Computer sciencemedia_common.quotation_subjectField (mathematics)Monotonic function02 engineering and technologyMathematical proofFormal proof020202 computer hardware & architectureAlgebraArtificial Intelligence0202 electrical engineering electronic engineering information engineeringReinforcement learning020201 artificial intelligence & image processingAlgorithmmedia_common
researchProduct

Stochastic discretized learning-based weak estimation: a novel estimation method for non-stationary environments

2016

The task of designing estimators that are able to track time-varying distributions has found promising applications in many real-life problems.Existing approaches resort to sliding windows that track changes by discarding old observations. In this paper, we report a novel estimator referred to as the Stochastic Discretized Weak Estimator (SDWE), that is based on the principles of discretized Learning Automata (LA). In brief, the estimator is able to estimate the parameters of a time varying binomial distribution using finite memory. The estimator tracks changes in the distribution by operating a controlled random walk in a discretized probability space. The steps of the estimator are discre…

Learning automataEstimator020206 networking & telecommunications02 engineering and technologyBinomial distributionUnivariate distributionEfficient estimatorArtificial IntelligenceSignal Processing0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingMultinomial distributionComputer Vision and Pattern RecognitionMinimax estimatorAlgorithmSoftwareInvariant estimatorMathematicsPattern Recognition
researchProduct

Distributed learning automata for solving a classification task

2016

In this paper, we propose a novel classifier in two-dimensional feature spaces based on the theory of Learning Automata (LA). The essence of our scheme is to search for a separator in the feature space by imposing a LA based random walk in a grid system. To each node in the gird we attach an LA, whose actions are the choice of the edges forming the separator. The walk is self-enclosing, i.e, a new random walk is started whenever the walker returns to starting node forming a closed classification path yielding a many edged polygon. In our approach, the different LA attached at the different nodes search for a polygon that best encircles and separates each class. Based on the obtained polygon…

Learning automataFeature vector020206 networking & telecommunications02 engineering and technologySupport vector machinesymbols.namesakeKernel methodKernel (statistics)PolygonRadial basis function kernel0202 electrical engineering electronic engineering information engineeringGaussian functionsymbols020201 artificial intelligence & image processingAlgorithmMathematics2016 IEEE Congress on Evolutionary Computation (CEC)
researchProduct

Enabling XCSF to cope with dynamic environments via an adaptive error threshold

2020

The learning classifier system XCSF is a variant of XCS employed for function approximation. Although XCSF is a promising candidate for deployment in autonomous systems, its parameter dependability imposes a significant hurdle, as a-priori parameter optimization is not feasible for complex and changing environmental conditions. One of the most important parameters is the error threshold, which can be interpreted as a target bound on the approximation error and has to be set according to the approximated function. To enable XCSF to reliably approximate functions that change during runtime, we propose the use of an error threshold, which is adapted at run-time based on the currently achieved …

Learning classifier systemComputer scienceError thresholdComputer Science::Neural and Evolutionary Computation0102 computer and information sciences02 engineering and technologyFunction (mathematics)01 natural sciencesSet (abstract data type)Function approximation010201 computation theory & mathematicsApproximation error0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingAlgorithmProceedings of the 2020 Genetic and Evolutionary Computation Conference Companion
researchProduct

Evolution and Learning: Evolving Sensors in a Simple MDP Environment

2003

Natural intelligence and autonomous agents face difficulties when acting in information-dense environments. Assailed by a multitude of stimuli they have to make sense of the inflow of information, filtering and processing what is necessary, but discarding that which is unimportant. This paper aims at investigating the interactions between evolution of the sensorial channel extracting the information from the environment and the simultaneous individual adaptation of agent-control. Our particular goal is to study the influence of learning on the evolution of sensors, with learning duration being the tunable parameter. A genetic algorithm governs the evolution of sensors appropriate for the a…

Learning classifier systembusiness.industryComputer science05 social sciencesAutonomous agentExperimental and Cognitive PsychologyGrid050105 experimental psychologyTask (project management)03 medical and health sciencesBehavioral Neuroscience0302 clinical medicineGenetic algorithmReinforcement learning0501 psychology and cognitive sciencesArtificial intelligencebusinessAdaptation (computer science)030217 neurology & neurosurgeryCommunication channelAdaptive Behavior
researchProduct