Search results for "A* algorithm"
showing 10 items of 2538 documents
Ant Colony Search algorithm for optimal strategical planning of electrical distribution systems expansion
2005
Strategical planning is one of many research fields in the design of electrical distribution systems. The problem of strategical planning is a multiobjective combinatorial problem and the search space may often be quite large concerning to the options. The aim is to identify a strategy of expansion of a given distribution system in a given timeframe. For this problem, the search space is created beforehand by running a multiobjective optimisation algorithm for the optimal design of distribution networks for different load levels related to different years. The sets of Pareto-optimal solutions obtained for each load level at each year are equivalent in terms of the considered objectives, the…
Mechanism-based selection of compounds for the development of innovative in vitro approaches to hepatotoxicity studies in the LIINTOP project.
2010
The 6th European Framework Programme project LIINTOP was specifically raised to optimise and provide established protocols and experimental in vitro models for testing intestinal and liver absorption, metabolism and toxicity of molecules of pharmacological interest. It has been focused on some of the most promising existing liver and intestine in vitro models with the aim of further improving their performance and thus taking them to a pre-normative research stage. Regarding the specific area of the liver, a first basic approach was the optimisation of in vitro hepatic models and the development and optimisation of in vitro approaches for toxicity screening. New advanced technologies have b…
Improving Pattern Recognition Based Pharmacological Drug Selection Through ROC Analysis
2004
The design of new medical drugs is a very complex process in which combinatorial chemistry techniques are used. The goal consists of discriminating between molecular compounds exhibiting or not certain pharmacological activities. Different machine learning approaches have been recently applied to different drug design problems leading to competitive results in pointing at particular compounds with high probability of exhibiting activity. The present work first deeps into the natural trade-off between accuracy in the much less populated active group and false alarm rate which could lead to too many expensive laboratory tests. Preliminary results show how different classification techniques a…
A Branch-and-Cut method for the Capacitated Location-Routing Problem
2011
International audience; Recent researches in the design of logistic networks have shown that the overall distribution cost may be excessive if routing decisions are ignored when locating depots. The Location-Routing Problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. The aim of this paper is to propose an exact approach based on a Branch-and-Cut algorithm for solving the LRP with capacity constraints on depots and vehicles. The proposed method is based on a zero-one linear model strengthened by new families of valid inequalities. The computational evaluation on three sets of instances (34 instances in total), with 5–10 potential depots and 20–88 …
Optimal Usage of Multiple Network Connections
2008
In the future mobile networks, a mobile terminal is able to select the best suitable network for each data transmission. The selection of a network connection to be used has been under a lot of study. In this paper, we consider a more extensive case in which we do not select a network connection but use several network connections simultaneously to transfer data. When data is transferred using multiple network connections, a network connection has to be selected for each component of the data. We have modelled this problem as a multiobjective optimization problem and developed a heuristic to solve the problem fast in a static network environment. In this paper, we discuss solving the proble…
On the Non-Intrusive Load Monitoring in dwellings: a feasibility perspective
2021
The oncoming modernization process of the power grids, driven above all by decarbonisation objectives and the continuous improvement of digital technologies, is encouraging active participation in the electricity market by consumers through the Demand-Response mechanism. From this perspective, the introduction of smart meters and energy consumption monitoring devices plays a fundamental role, being able to give benefits to consumers, suppliers and the electricity grid itself. This paper proposes a supervised method of non-intrusive load monitoring (NILM) based on the recognition of patterns in the time domain with the Dynamic Time Warping algorithm which is suitable for low-cost smart meter…
An Online Time Warping based Map Matching for Vulnerable Road Users’ Safety
2018
International audience; High penetration rate of Smartphones and their increased capabilities to sense, compute, store and communicate have made the devices vital components of intelligent transportation systems. However, their GPS positions accuracy remains insufficient for a lot of location-based applications especially traffic safety ones. In this paper, we developed a new algorithm which is able to improve smartphones GPS accuracy for vulnerable road users' traffic safety. It is a two-stage algorithm: in the first stage GPS readings obtained from smartphones are passed through Kalman filter to smooth deviated reading. Then an adaptive online time warping based map matching is applied to…
On the use of a metric-space search algorithm (AESA) for fast DTW-based recognition of isolated words
1988
The approximating and eliminating search algorithm (AESA) presented was recently introduced for finding nearest neighbors in metric spaces. Although the AESA was originally developed for reducing the time complexity of dynamic time-warping isolated word recognition (DTW-IWR), only rather limited experiments had been previously carried out to check its performance in this task. A set of experiments aimed at filling this gap is reported. The main results show that the important features reflected in previous simulation experiments are also true for real speech samples. With single-speaker dictionaries of up to 200 words, and for most of the different speech parameterizations, local metrics, a…
Feature selection for distance-based regression: An umbrella review and a one-shot wrapper
2023
Feature selection (FS) may improve the performance, cost-efficiency, and understandability of supervised machine learning models. In this paper, FS for the recently introduced distance-based supervised machine learning model is considered for regression problems. The study is contextualized by first providing an umbrella review (review of reviews) of recent development in the research field. We then propose a saliency-based one-shot wrapper algorithm for FS, which is called MAS-FS. The algorithm is compared with a set of other popular FS algorithms, using a versatile set of simulated and benchmark datasets. Finally, experimental results underline the usefulness of FS for regression, confirm…
Niche filling slows the diversification of Himalayan songbirds.
2013
In Himalayan songbirds, the speciation rate is ultimately set by ecological competition, rather than by the rate of acquisition of reproductive isolation. The beginnings of adaptive radiation and speciation have been widely studied — in Darwin's finches, sticklebacks and cichlid fish, for example — but relatively little is known about what happens next. Specifically, what is the rate-limiting step for the establishment of new species? This seven-year study of the 358 songbird species found on the Himalayan slopes suggests that it is the rates at which new niches are created and occupied that limits diversification, not the rate at which new species form through reproductive isolation. Speci…