Isbn: 9781848211308 - ant colony optimization and constraint programming (17 resultados)

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: As New. Unread book in perfect condition.

Condición: NEW.

Condición: New.

Condición: New. In English.

Hardback. Condición: New. New copy - Usually dispatched within 4 working days.

Condición: New. Brand new! Please provide a physical shipping address.

Condición: New. Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts. Num Pages: 246 pages, Illustrations. BIC Classification: UM. Category: (P) Professional & Vocational. Dimension: 234 x 163 x 19. Weight in Grams: 506. . 2010. 1st Edition. Hardcover. . . . .…

HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Hardback. Condición: New. Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts. The first part introduces constraint programming, which provides high level features to declaratively model problems by means of constraints. It describes the main existing approaches for solving constraint satisfaction problems, including complete tree search approaches and metaheuristics, and shows how they can be integrated within constraint programming languages. The second part describes the ant colony optimization metaheuristic and illustrates its capabilities on different constraint satisfaction problems. The third part shows how the ant colony may be integrated within a constraint programming language, thus combining the expressive power of constraint programming languages, to describe problems in a declarative way, and the solving power of ant colony optimization to efficiently solve these problems.…

Hardcover. Condición: Brand New. 1st edition. 320 pages. 9.25x6.25x0.50 inches. In Stock.

Buch. Condición: Neu. Neuware - Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts.The first part introduces constraint programming, which provides high level features to declaratively model problems by means of constraints. It describes the main existing approaches for solving constraint satisfaction problems, including complete tree search approaches and metaheuristics, and shows how they can be integrated within constraint programming languages.The second part describes the ant colony optimization metaheuristic and illustrates its capabilities on different constraint satisfaction problems.The third part shows how the ant colony may be integrated within a constraint programming language, thus combining the expressive power of constraint programming languages, to describe problems in a declarative way, and the solving power of ant colony optimization to efficiently solve these problems.…

Condición: New. Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a sp.

Condición: New. Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts. Num Pages: 246 pages, Illustrations. BIC Classification: UM. Category: (P) Professional & Vocational. Dimension: 234 x 163 x 19. Weight in Grams: 506. . 2010. 1st Edition. Hardcover. . . . . Books ship from the US and Ireland.…

Buch. Condición: Neu. Ant Colony Optimization and Constraint Programming | Christine Solnon | Buch | Einband - fest (Hardcover) | Englisch | 2010 | Wiley | EAN 9781848211308 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu.

Hardback. Condición: New. Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts. The first part introduces constraint programming, which provides high level features to declaratively model problems by means of constraints. It describes the main existing approaches for solving constraint satisfaction problems, including complete tree search approaches and metaheuristics, and shows how they can be integrated within constraint programming languages. The second part describes the ant colony optimization metaheuristic and illustrates its capabilities on different constraint satisfaction problems. The third part shows how the ant colony may be integrated within a constraint programming language, thus combining the expressive power of constraint programming languages, to describe problems in a declarative way, and the solving power of ant colony optimization to efficiently solve these problems.…