Search results for "A* algorithm"
showing 10 items of 2538 documents
Towards efficient inductive synthesis of expressions from input/output examples
1993
Our goal through several years has been the development of efficient search algorithm for inductive inference of expressions using only input/output examples. The idea is to avoid exhaustive search by means of taking full advantage of semantic equality of many considered expressions. This might be the way that people avoid too big search when finding proof strategies for theorems, etc. As a formal model for the development of the method we use arithmetic expressions over the domain of natural numbers. A new approach for using weights associated with the functional symbols for restricting search space is considered. This allows adding constraints like the frequency of particular symbols in t…
Modelling the insect Mushroom Bodies: Application to sequence learning
2015
Learning and reproducing temporal sequences is a fundamental ability used by living beings to adapt behaviour repertoire to environmental constraints. This paper is focused on the description of a model based on spiking neurons, able to learn and autonomously generate a sequence of events. The neural architecture is inspired by the insect Mushroom Bodies (MBs) that are a crucial centre for multimodal sensory integration and behaviour modulation. The sequence learning capability coexists, within the insect brain computational model, with all the other features already addressed like attention, expectation, learning classification and others. This is a clear example that a unique neural struc…
Architectural improvements and FPGA implementation of a multimodel neuroprocessor
2003
Since neural networks (NNs) require an enormous amount of learning time, various kinds of dedicated parallel computers have been developed. In the paper a 2-D systolic array (SA) of dedicated processing elements (PEs) also called systolic cells (SCs) is presented as the heart of a multimodel neural-network accelerator. The instruction set of the SA allows the implementation of several neural algorithms, including error back propagation and a self organizing feature map algorithm. Several special architectural facilities are presented in the paper in order to improve the 2-D SA performance. A swapping mechanism of the weight matrix allows the implementation of NNs larger than 2-D SA. A systo…
SWAPHI-LS: Smith-Waterman Algorithm on Xeon Phi coprocessors for Long DNA Sequences
2014
As an optimal method for sequence alignment, the Smith-Waterman (SW) algorithm is widely used. Unfortunately, this algorithm is computationally demanding, especially for long sequences. This has motivated the investigation of its acceleration on a variety of high-performance computing platforms. However, most work in the literature is only suitable for short sequences. In this paper, we present SWAPHI-LS, the first parallel SW algorithm exploiting emerging Xeon Phi coprocessors to accelerate the alignment of long DNA sequences. In SWAPHI-LS, we have investigated three parallelization approaches (naive, tiled, and distributed) in order to deeply explore the inherent parallelism within Xeon P…
Control points deployment in an Intelligent Transportation System for monitoring inter-urban network roadway
2022
Abstract The constant evolution of transportation systems and traffic in developing countries is nowadays confronted with a problem of road safety and therefore of a high accident rate, especially in the context of inter-urban road transport. In this work, we propose a communication architecture for an Intelligent Transport System (ITS) to provide surveillance in an inter-urban transport network in the context of developing countries. We introduce two types of control points: Relay Control Points (RCP) and Treatment Control Points (TrCP). We also designed two multi-objective models for the deployment of these points. In order to ensure good coverage, to minimize the cost of installation and…
An Experimental Testbed and Methodology for Characterizing IEEE 802.11 Network Cards
2006
It has been observed that IEEE 802.11 commercial cards produced by different vendors show a different behavior in terms of perceived throughput or access delay. Performance differences are evident both when the cards contend alone to the channel, and when heterogeneous cards contend together. Since the performance misalignment does not disappear by averaging the environmental factors (such as propagation conditions, laptop models, traffic generators, etc), it is evident that the well known throughput-fairness property of the DCF protocol is not guaranteed in actual networks. In this paper we propose a methodological approach devised to experimentally characterize the IEEE 802.11 commercial …
Reconfigurable electrical interconnection strategies for photovoltaic arrays: A review
2014
Non-uniform irradiance significantly decreases the power delivered by solar photovoltaic arrays. A promising technique for compensating these power losses relies on dynamically reconfiguring the electrical connections between photovoltaic modules. This paper presents the current state-of-the-art strategies for photovoltaic array reconfiguration in order to increase the power output under partial shading and mismatch conditions. The different approaches have been compared in terms of effectiveness of the control algorithms, monitored electrical and environmental variables, overall hardware complexity and specific features of each solution. Finally, the most challenging aspects of the reconfi…
Selection and evaluation of Internet information by adults with intellectual disabilities
2018
Internet offers people with intellectual disabilities (ID) unique opportunities to access information and to participate in society. But concerns have been raised about the potential risks they face when accessing the Internet (e.g. giving credit to false information, being exposed to manipulative content). As part of the current debate between positive risk-taking and overprotection, our study empirically tested the extent to which 43 adults with ID identified and selected topically relevant as well as trustworthy web pages while searching the Internet for several topics (e.g. Can social networks use your pictures for advertisement?). Participants also justified their search decisions. Res…
PGAC: A Parallel Genetic Algorithm for Data Clustering
2005
Cluster analysis is a valuable tool for exploratory pattern analysis, especially when very little a priori knowledge about the data is available. Distributed systems, based on high speed intranet connections, provide new tools in order to design new and faster clustering algorithms. Here, a parallel genetic algorithm for clustering called PGAC is described. The used strategy of parallelization is the island model paradigm where different populations of chromosomes (called demes) evolve locally to each processor and from time to time some individuals are moved from one deme to another. Experiments have been performed for testing the benefits of the parallelisation paradigm in terms of comput…
Formulations for an inventory routing problem
2014
In this paper, we present and compare formulations for the inventory routing problem (IRP) where the demand of customers has to be served, over a discrete time horizon, by capacitated vehicles starting and ending their routes at a depot. The objective of the IRP is the minimization of the sum of inventory and transportation costs. The formulations include known and new mathematical programming formulations. Valid inequalities are also presented. The formulations are tested on a large set of benchmark instances. One of the most significant conclusions is that the formulations that use vehicle-indexed variables are superior to the more compact, aggregate formulations.