storiet v.2

theme

voice

language

sign in
Capa de Constraint Satisfaction Techniques for Agent-Based Reasoning (Whitestein Series in Software Agent Technologies and Autonomic Computing)

a novel ·

Constraint Satisfaction Techniques for Agent-Based Reasoning (Whitestein Series in Software Agent Technologies and Autonomic Computing)

por

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 …

start reading + shelf
  • ● 98% match for you
  • ● art & photography, science & technology

the long version

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.

M

Margaret's verdict

"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 …"

— Margaret

highlights

what readers held onto

No highlights yet. Be the first.

discussion

what readers said

No reviews yet. Finish it; tell us what you found.