Sciweavers

70 search results - page 4 / 14
» An exploration of ranking heuristics in mobile local search
Sort
View
PPL
2010
117views more  PPL 2010»
13 years 2 months ago
Neighborhood Structures for GPU-Based Local Search Algorithms
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
ICRA
2003
IEEE
147views Robotics» more  ICRA 2003»
14 years 23 days ago
A genetic algorithm for simultaneous localization and mapping
— This paper addresses the problem of simultaneous localization and mapping (SLAM) by a mobile robot. The SLAM problem is defined as a global optimization problem in which the o...
Tom Duckett
ICRA
2002
IEEE
188views Robotics» more  ICRA 2002»
14 years 12 days ago
Hybrid Mobile Robot Localization using Switching State-Space Models
—This article describes a rigorous and complete framework for the simultaneous localization and map building problem for mobile robots: the symmetries and perturbations map (SPma...
Haris Baltzakis, Panos E. Trahanias
WWW
2008
ACM
14 years 8 months ago
Information "uptrieval": exploring models for content assimilation and aggregation for developing regions
Information Retrieval on the WWW is important because it is hard to find what one is looking for. There is a plethora of information available, and searching relevant information ...
Sheetal K. Agarwal, Arun Kumar, Sougata Mukherjea,...
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
14 years 2 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke