2715 search results - page 317 / 543 » Total Generalized Variation |
145
click to vote
GECCO
2009
Springer
15 years 8 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...
136
click to vote
GECCO
2009
Springer
15 years 8 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...
137
click to vote
SBMF
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
139
click to vote
FOSSACS
2001
Springer
15 years 8 months ago
2001
Springer
Garbage collection relieves the programmer of the burden of managing dynamically allocated memory, by providing an automatic way to reclaim unneeded storage. This eliminates or les...
115
click to vote
LCTRTS
2001
Springer
15 years 8 months ago
2001
Springer
Computers are increasingly being incorporated in devices with a limited amount of available memory. As a result research is increasingly focusing on the automated reduction of pro...