Sciweavers

540 search results - page 77 / 108
» Competitive Routing over Time
Sort
View
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
14 years 1 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
IJCAI
2007
13 years 11 months ago
Online Speed Adaptation Using Supervised Learning for High-Speed, Off-Road Autonomous Driving
The mobile robotics community has traditionally addressed motion planning and navigation in terms of steering decisions. However, selecting the best speed is also important – be...
David Stavens, Gabriel Hoffmann, Sebastian Thrun
AIPS
2000
13 years 11 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner
SIROCCO
2000
13 years 11 months ago
Cooperative computing with fragmentable and mergeable groups
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
Chryssis Georgiou, Alexander A. Shvartsman
TKDE
2008
154views more  TKDE 2008»
13 years 10 months ago
Analyzing the Structure and Evolution of Massive Telecom Graphs
Abstract-- With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customer...
Amit Anil Nanavati, Rahul Singh, Dipanjan Chakrabo...