This class was created by Brainscape user Kei Matsunaga. Visit their profile to learn more about the creator.
By:
Kei Matsunaga
- decks
- flashcards
- learners
Decks in this class (21)
L01: Introduction
How do we solve problems with con...,
What are the stages of constraint...,
What is a constraint
10
cards
L02: Modelling Introduction
What are some common features of ...,
What are some examples of constra...,
What are the 2 components of cons...
19
cards
L03: Sequences
Explain this essence model langua...,
How can we build a constraint mod...,
How do we know which viewpoint to...
23
cards
L04: Sets
Can we have a combined representa...,
How can we derive a finite domain...,
How can we use explicit represent...
22
cards
L05: Multisets
What is the occurrence model for ...,
How can we express the distinct d...,
What is a multiset
16
cards
L06: Functions
What is a function,
Where does the function pattern o...,
What is a total function
17
cards
L06: Nesting
What is nesting,
How do planning problems employ n...,
How can we represent nesting insi...
4
cards
L07: Symmetry
What is symmetry,
How does symmetry partition compl...,
Why do we want to recognise symme...
17
cards
L08: Nesting Inside Sets
Which representations can we use ...,
What is the problem class for nes...,
12
cards
L09: Multiple Viewpoints
Why might we need multiple viewpo...,
What is chanelling,
What are branching variables
9
cards
L10: Solving Motivation
What are the 2 components of cons...,
What are the advantages of writin...,
Why should we use generic solvers
5
cards
L11: Basic Solution Procedures
Define search,
Define systematic search,
Define backtracking
18
cards
L12: Graphical Representations, Constraint Propagation
Why is it useful to view a csp as...,
What is a binary constraint graph,
What is a hyper edge
18
cards
L13: Combining Search and Propagation
Fundamentally how do systematic s...,
What is forward checking,
What are the advantages of forwar...
10
cards
L14: MAC and more branching
What is d way branching,
What is 2 way branching,
Compare 2 way with d way branching
14
cards
L15: Variable Heuristics
What are static heuristics,
What are some operations we can o...,
What are dynamic heuristics
29
cards
L16: AC3
What is geelen s promise,
How does geelen s value ordering ...,
Why does value assi
16
cards
L17: Loopback Schemes, Backjumping
What is a look ahead scheme,
What is a look back scheme,
How do we classify backtrack
8
cards
L18: Conflict Recording
What is conflict recording,
What is a minimal conflict set,
How can we improve graph based le...
11
cards
L19: K-Consistency
What is k consistency,
What is strong k consistency,
What does constraints among them ...
13
cards
L20: Cost of GAC
Is gac expensive,
What is an alternative,
What is bound consistency
7
cards
More about
Constraint Programming
- Class purpose General learning
Learn faster with Brainscape on your web, iPhone, or Android device. Study Kei Matsunaga's Constraint Programming flashcards now!
How studying works.
Brainscape's adaptive web mobile flashcards system will drill you on your weaknesses, using a pattern guaranteed to help you learn more in less time.
Add your own flashcards.
Either request "Edit" access from the author, or make a copy of the class to edit as your own. And you can always create a totally new class of your own too!
What's Brainscape anyway?
Brainscape is a digital flashcards platform where you can find, create, share, and study any subject on the planet.
We use an adaptive study algorithm that is proven to help you learn faster and remember longer....
Looking for something else?
Programming
- 10 decks
- 354 flashcards
- 58 learners
Decks:
Intro To Java, Cs50 Week 1, Mit 600 Week 1, And more!
Lucianna's Program
- 20 decks
- 832 flashcards
- 10 learners
Decks:
Spelling, Spelling 3, Fraction To Decimals, And more!
