• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Constraint Satisfaction Techniques for Agent-Based Reasoning

Constraint Satisfaction Techniques for Agent-Based Reasoning

Paperback

Series: Whitestein Software Agent Technologies and Autonomic Computing

General Computers

ISBN10: 3764372176
ISBN13: 9783764372170
Publisher: Springer Nature
Published: Jan 28 2005
Pages: 158
Weight: 0.56
Height: 0.38 Width: 6.14 Depth: 9.21
Language: English

Constraint satisfaction problems are significant in the domain of automated reasoning for artificial intelligence. They can be applied to the modeling and solving of a wide range of combinatorial applications such as planning, scheduling and resource sharing in a variety of practical domains such as transportation, production, supply-chains, network management and human resource management. In this book we study new techniques for solving constraint satisfaction problems, with a special focus on solution adaptation applied to agent reasoning.

Also in

General Computers