Sciweavers

8647 search results - page 137 / 1730
» The Container Selection Problem
Sort
View
ICRA
2009
IEEE
170views Robotics» more  ICRA 2009»
15 years 9 months ago
Path diversity is only part of the problem
— The goal of motion planning is to find a feasible path that connects two positions and is free from collision with obstacles. Path sets are a robust approach to this problem i...
Ross A. Knepper, Matthew T. Mason
CP
1998
Springer
15 years 7 months ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
ICIP
2003
IEEE
16 years 4 months ago
A Bayesian approach to inclusion and performance analysis of using extra information in bioelectric inverse problems
Due to attenuation and spatial smoothing that occurs in the conducting media, the bioelectric inverse problem of estimating sources from remote measurements is ill-posed and solut...
Yesim Serinagaoglu, Dana H. Brooks, Robert S. MacL...
EVOW
2004
Springer
15 years 8 months ago
A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem
Abstract. The implementation of an evolutionary algorithm necessarily involves the selection of an appropriate set of genetic operators. For many real-world problem domains, an inc...
Wouter Boomsma
IJCAI
1989
15 years 4 months ago
A Planning/Scheduling Methodology for the Constrained Resource Problem
This paper presents a new planning/scheduling methodology for the constrained resource problem (CRP), in which the amount of available resources is limited and usually monotonical...
Naiping Keng, David Y. Y. Yun