Sciweavers

155 search results - page 6 / 31
» A Comparison Between ACO Algorithms for the Set Covering Pro...
Sort
View
IROS
2009
IEEE
151views Robotics» more  IROS 2009»
14 years 1 months ago
A comparison of SLAM algorithms based on a graph of relations
— In this paper, we address the problem of creating an objective benchmark for comparing SLAM approaches. We propose a framework for analyzing the results of SLAM approaches base...
Wolfram Burgard, Cyrill Stachniss, Giorgio Grisett...

Publication
222views
14 years 3 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis
DEXA
2009
Springer
153views Database» more  DEXA 2009»
13 years 10 months ago
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, ...
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 6 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
ICAL
2011
301views more  ICAL 2011»
12 years 6 months ago
On the LVI-based numerical method (E47 algorithm) for solving quadratic programming problems
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
Yunong Zhang, Senbo Fu, Zhijun Zhang, Lin Xiao, Xu...