IDC Class Reference
#include <IDC.h>
Inheritance diagram for IDC:
List of all members.
|
Public Member Functions |
| | IDC (Problem &problem, Filter &filter, Retraction &retraction, Randomizer &randomizer, double choiceFactor=IDC_DEFAULT_CHOICE_FACTOR) |
Protected Member Functions |
| | IDC (const wstring &fullName, const wstring &shortName, Problem &problem, Filter &filter, Retraction &retraction, Randomizer &randomizer, double choiceFactor=IDC_DEFAULT_CHOICE_FACTOR) |
Protected Attributes |
|
bool | m_mcExtension |
| | Flag controlling the activation of the MC extension.
|
|
double | m_choiceFactor |
| | Choice factor for IDC[[-MC]-PDS].
|
Detailed Description
The IDC[[-MC]-PDS] decomposition algorithms. That is, the following IDC algorithms are implemented: IDC, IDC-MC, IDC-PDS, IDC-MC-PDS. The implementation is based on "Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems" by Eugene C. Freuder and Paul D. Hubbe", Department of Computer Science, University of New Hampshire, Durham, NH, 03824, USA.
Note that the MC extension (i.e. the extra filtrations) is not activated by default, you should use the IDCMC class for that. IDCMC is just a wrapper around IDC that will turn on the MC extension.
This class will work as IDC when used directly. It will behave like IDC-PDS only when used through the decomposition driver and only if it can yield control to some other decomposition algorithm.
Constructor & Destructor Documentation
| IDC::IDC |
( |
Problem & |
problem, |
|
|
Filter & |
filter, |
|
|
Retraction & |
retraction, |
|
|
Randomizer & |
randomizer, |
|
|
double |
choiceFactor = IDC_DEFAULT_CHOICE_FACTOR |
|
) |
[inline] |
|
|
|
Constructor for the IDC decomposition algorithm.
- Parameters:
-
| problem | the problem to be solved. |
| filter | the filter to be used. |
| retraction | the retraction method to be used. |
| randomizer | the random number generator to be used. |
| choiceFactor | the IDC[[-MC]-PDS] choice factor; when the size of the consistent subproblem times the choice factor is less than the remainder subproblem size, the IDC-PDS algorithm will yield control to the next decomposition algorithm in the decomposition driver's chain (provided that a driver is installed). |
|
| IDC::IDC |
( |
const wstring & |
fullName, |
|
|
const wstring & |
shortName, |
|
|
Problem & |
problem, |
|
|
Filter & |
filter, |
|
|
Retraction & |
retraction, |
|
|
Randomizer & |
randomizer, |
|
|
double |
choiceFactor = IDC_DEFAULT_CHOICE_FACTOR |
|
) |
[inline, protected] |
|
|
|
Constructor for variations of the IDC decomposition algorithm.
- Parameters:
-
| fullName | the full name of the variation. |
| shortName | the short name of the variation. |
| problem | the problem to be solved. |
| filter | the filter to be used. |
| retraction | the retraction method to be used. |
| randomizer | the random number generator to be used. |
| choiceFactor | the IDC[[-MC]-PDS] choice factor. |
|
The documentation for this class was generated from the following files:
Generated on Wed May 25 12:21:19 2005 for csp.kdevelop by
1.3.9.1