Sciweavers

989 search results - page 94 / 198
» Approximating the Pareto optimal set using a reduced set of ...
Sort
View
AAAI
1994
13 years 9 months ago
Learning to Select Useful Landmarks
To navigate effectively, an autonomous agent must be able to quickly and accurately determine its current location. Given an initial estimate of its position (perhaps based on dea...
Russell Greiner, Ramana Isukapalli
BMCBI
2008
170views more  BMCBI 2008»
13 years 8 months ago
A genetic approach for building different alphabets for peptide and protein classification
Background: In this paper, it is proposed an optimization approach for producing reduced alphabets for peptide classification, using a Genetic Algorithm. The classification task i...
Loris Nanni, Alessandra Lumini
PAMI
2006
99views more  PAMI 2006»
13 years 8 months ago
A New Convexity Measure Based on a Probabilistic Interpretation of Images
In this article we present a novel convexity measure for object shape analysis. The proposed method is based on the idea of generating pairs of points from a set, and measuring th...
Esa Rahtu, Mikko Salo, Janne Heikkilä
MP
1998
109views more  MP 1998»
13 years 7 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
ROBIO
2006
IEEE
153views Robotics» more  ROBIO 2006»
14 years 2 months ago
GA-based Feature Subset Selection for Myoelectric Classification
– This paper presents an ongoing investigation to select optimal subset of features from set of well-known myoelectric signals (MES) features in time and frequency domains. Four ...
Mohammadreza Asghari Oskoei, Huosheng Hu