Sciweavers

1026 search results - page 6 / 206
» An Optimal Solution to Room Search Problem
Sort
View
IROS
2008
IEEE
95views Robotics» more  IROS 2008»
14 years 1 months ago
Energy management for indoor hovering robots
— Flying has an advantage when compared to ground based locomotion, as it simplifies the task of overcoming obstacles and allows for rapid coverage of an area while also providi...
James F. Roberts, Jean-Christophe Zufferey, Dario ...
EVOW
2005
Springer
14 years 27 days ago
Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem
This paper presents the Scatter Search Particle Filter (SSPF) algorithm and its application to the Dynamic Travelling Salesman Problem (DTSP). SSPF combines sequential estimation a...
Juan José Pantrigo, Abraham Duarte, Á...
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
14 years 1 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
AIPS
2006
13 years 8 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
13 years 11 months ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa