Sciweavers

13376 search results - page 299 / 2676
» Problem Solving with
Sort
View
ATAL
2005
Springer
15 years 9 months ago
Coordinated exploration of unknown labyrinthine environments applied to the pursuit evasion problem
This paper introduces a multi-robot cooperation approach to solve the pursuit evasion problem for mobile robots that have omnidirectional vision sensors in unknown environments. T...
Damien Pellier, Humbert Fiorino
ICTAI
2003
IEEE
15 years 9 months ago
A Diversity-Controlling Adaptive Genetic Algorithm for the Vehicle Routing Problem with Time Windows
This paper presents an adaptive genetic algorithm (GA) to solve the Vehicle Routing Problem with Time Windows (VRPTW) to near optimal solutions. The algorithm employs a unique dec...
Kenny Qili Zhu
MOC
2000
85views more  MOC 2000»
15 years 3 months ago
Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
Recently, based upon the Chen-Harker-Kanzow-Smale smoothing function and the trajectory and the neighbourhood techniques, Hotta and Yoshise proposed a noninterior point algorithm f...
Liqun Qi, Defeng Sun
TJS
2002
122views more  TJS 2002»
15 years 3 months ago
Optimal BSR Solutions to Several Convex Polygon Problems
Abstract. This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time soluti...
Jean Frédéric Myoupo, David Sem&eacu...
RC
2007
64views more  RC 2007»
15 years 3 months ago
Unimodality, Independence Lead to NP-Hardness of Interval Probability Problems
In many real-life situations, we only have partial information about probabilities. This information is usually described by bounds on moments, on probabilities of certain events,...
Daniel Berleant, Olga Kosheleva, Vladik Kreinovich...