EUR 17,64 expédition depuis Royaume-Uni vers Etats-Unis
Destinations, frais et délaisEUR 3,53 expédition vers Etats-Unis
Destinations, frais et délaisVendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020089896
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 23289484-n
Quantité disponible : Plus de 20 disponibles
Vendeur : Chiron Media, Wallingford, Royaume-Uni
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783319164670
Quantité disponible : 10 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9783319164670_new
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 23289484-n
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book constitutes the refereed proceedings of the 15th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2015, held in Copenhagen, Denmark, in April 2015, co-located with the Evo\*2015 events EuroGP, EvoMUSART and EvoApplications.The 19 revised full papers presented were carefully reviewed and selected from 46 submissions. The papers cover methodology, applications and theoretical studies. The methods included evolutionary and memetic (hybrid) algorithms, iterated local search, variable neighbourhood search, ant colony optimization, artificial immune systems, hyper-heuristics and other adaptive approaches. The applications include both traditional domains, such as graph coloring, knapsack, vehicle routing, job-shop scheduling, the p-median and the orienteering problems; and new(er) domains such as designing deep recurrent neural networks, detecting network community structure, lock scheduling of ships, cloud resource management, the fire-fighter problem and AI planning. The theoretical studies involved approximation ratio, runtime and black-box complexity analyses. 248 pp. Englisch. N° de réf. du vendeur 9783319164670
Quantité disponible : 2 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 15th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2015, held in Copenhagen, Denmark, in April 2015, co-located with the Evo\*2015 events EuroGP, EvoMUSART and EvoApplications.The 19 revised full papers presented were carefully reviewed and selected from 46 submissions. The papers cover methodology, applications and theoretical studies. The methods included evolutionary and memetic (hybrid) algorithms, iterated local search, variable neighbourhood search, ant colony optimization, artificial immune systems, hyper-heuristics and other adaptive approaches. The applications include both traditional domains, such as graph coloring, knapsack, vehicle routing, job-shop scheduling, the p-median and the orienteering problems; and new(er) domains such as designing deep recurrent neural networks, detecting network community structure, lock scheduling of ships, cloud resource management, the fire-fighter problem and AI planning. The theoretical studies involved approximation ratio, runtime and black-box complexity analyses. N° de réf. du vendeur 9783319164670
Quantité disponible : 1 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. 235. N° de réf. du vendeur 26372810313
Quantité disponible : 4 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand pp. 235. N° de réf. du vendeur 374283670
Quantité disponible : 4 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 2015 edition. 228 pages. 9.25x6.10x0.71 inches. In Stock. N° de réf. du vendeur x-3319164678
Quantité disponible : 2 disponible(s)