1034 search results - page 151 / 207 » Competitive generalized auctions |
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...
AGENTS
2001
Springer
14 years 1 months ago
2001
Springer
This paper describes a completely implemented, fully autonomous software system for soccer playing quadruped robots. The system includes real-time color vision, probabilistic loca...
CP
2001
Springer
14 years 1 months ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
ICOIN
2001
Springer
14 years 1 months ago
2001
Springer
According to the progress of high-speed networks, many communication protocols are specified as concurrent systems. Such systems can be modeled as concurrent deterministic FSMs (D...