3433 search results - page 259 / 687 » Heuristics for a bidding problem |
189
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider the Offline Ad Slot Scheduling problem, where advertisers must be scheduled to sponsored search slots during a given period of time. Advertisers specify a budget constr...
190
click to vote
IJRR
2006
15 years 6 months ago
2006
Current technological developments and application-driven demands are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missio...
149
click to vote
IWANN
2001
Springer
15 years 11 months ago
2001
Springer
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...
154
click to vote
ICRA
2005
IEEE
16 years 9 days ago
2005
IEEE
— This paper introduces the multi-robot boundary coverage problem, wherein a group of k robots must inspect every point on the boundary of a 2-dimensional test environment. Using...
172
click to vote
CEC
2003
IEEE
16 years 5 hour ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...