Determining compliance rates for probabilistic requests
AssigneeInternational Business Machines Corporation
InventorsShady Copty, Roy Emek, Itai Jaeger, Yoav Katz, Shai Lubliner
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorsShady Copty, Roy Emek, Itai Jaeger, Yoav Katz, Shai Lubliner
Estimating the term…
Systems and methods for solving a constraint satisfaction problem (CSP) defined by one or more variables, constraints and probabilistic requests (PRs) are provided. In one embodiment, each PR is mapped onto a set of constraints that implement the PR. The CSP solver then finds a series of solutions to the CSP. For each solution, if a constraint associated with a PR is satisfied, then a success counter for that PR is incremented; else a failure counter for that PR is incremented. If the constraint was not considered for the purpose of solving the CSP, then the failure counter for the PR associated with the constraint is incremented.
A method for determining compliance of one or more solutions with a probabilistic request submitted for solving a constraint satisfaction problem (CSP), wherein the CSP is defined by one or more variables and constraints such that the constraints define limitations for values that can be assigned to each variable in a given domain to solve the CSP, the method comprising:
A system for determining compliance of one or more solutions with a probabilistic request submitted for solving a constraint satisfaction problem (CSP), wherein the CSP is defined by one or more variables and constraints such that the constraints define limitations for values that can be assigned to each variable in a given domain to solve the CSP, the system comprising:
A computer program product comprising a computer useable medium having a computer readable program, wherein the computer readable program when executed on a computer causes the computer to:
Dependencies are inferred from the claim text.