Constraint Satisfaction Techniques for Agent-Based Reasoning
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...
Κύριος συγγραφέας: | Neagu, Nicoleta (Συγγραφέας) |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Basel :
Birkhäuser Basel,
2005.
|
Σειρά: | Whitestein Series in Software Agent Technologies
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Constraint Satisfaction Techniques for Agent-Based Reasoning
ανά: Neagu, Nicoleta
Έκδοση: (2005) -
Bridging Constraint Satisfaction and Boolean Satisfiability
ανά: Petke, Justyna
Έκδοση: (2015) -
The Complexity of Valued Constraint Satisfaction Problems
ανά: Živný, Stanislav
Έκδοση: (2012) -
Agent-Based Ubiquitous Computing
ανά: Mangina, Eleni, κ.ά.
Έκδοση: (2010) -
Case-Based Approximate Reasoning
ανά: Hüllermeier, Eyke
Έκδοση: (2007)