540 search results - page 77 / 108 » Competitive Routing over Time |
GECCO
2000
Springer
15 years 5 months ago
2000
Springer
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...
112
Voted
IJCAI
2007
15 years 3 months ago
2007
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...
114
click to vote
AIPS
2000
15 years 3 months ago
2000
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...
119
click to vote
SIROCCO
2000
15 years 3 months ago
2000
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...
108
Voted
TKDE
2008
15 years 1 months ago
2008
Abstract-- With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customer...