会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明公开
    • A combination problem solving apparatus
    • 组合问题解决方案
    • EP0486037A3
    • 1993-06-09
    • EP91119482.7
    • 1991-11-14
    • FUJITSU LIMITED
    • Maruyama, FumihiroMinoda, YorikoSawada, ShuhoTakizawa, YukaYoshida, Hiroyuki
    • G06F15/20
    • G06Q10/04G06F17/505
    • A computer based combination problem processor solves constrained combination satisfaction problems for determining discrete values of respective variables in which the constraint is externally specified by a set of inequalities and equalities, and solves combination optimization problems for determining the discrete values of respective variables to minimize or maximize the value of a given objective function. The computer comprises an initial constraint violating inequality creator for creating constraint violating inequalities reciprocal to the set of inequalities; a variable value changer for changing a variable value for examination of meeting constraints; a variable selector for selecting a value of a variable whose value is unknown; a constraint violating condition creator for creating a new constraint violating condition obtained as a logical product of simplified inequalities by digitizing a variable appearing in the constraint violating conditions created from the constraint violating inequalities, when none of the values satisfy the constraints produced by the processes by the variable value changer or the variable value selector. A constraint violating condition storer stores constraint violating conditions created by the constraint violating condition creator. A variable value is changed or selected such that none of the constraint violating conditions stored in the constraint violating condition storer are satisfied. The above obtained variable value combination satisfying none of the constraint violating conditions is the solution to the constrained combination satisfaction problem or the constrained combination optimization problem.
    • 3. 发明公开
    • A combination problem solving apparatus
    • Kombinationsproblem-Lösungsvorrichtung。
    • EP0486037A2
    • 1992-05-20
    • EP91119482.7
    • 1991-11-14
    • FUJITSU LIMITED
    • Maruyama, FumihiroMinoda, YorikoSawada, ShuhoTakizawa, YukaYoshida, Hiroyuki
    • G06F15/20
    • G06Q10/04G06F17/505
    • A computer based combination problem processor solves constrained combination satisfaction problems for determining discrete values of respective variables in which the constraint is externally specified by a set of inequalities and equalities, and solves combination optimization problems for determining the discrete values of respective variables to minimize or maximize the value of a given objective function. The computer comprises an initial constraint violating inequality creator for creating constraint violating inequalities reciprocal to the set of inequalities; a variable value changer for changing a variable value for examination of meeting constraints; a variable selector for selecting a value of a variable whose value is unknown; a constraint violating condition creator for creating a new constraint violating condition obtained as a logical product of simplified inequalities by digitizing a variable appearing in the constraint violating conditions created from the constraint violating inequalities, when none of the values satisfy the constraints produced by the processes by the variable value changer or the variable value selector. A constraint violating condition storer stores constraint violating conditions created by the constraint violating condition creator. A variable value is changed or selected such that none of the constraint violating conditions stored in the constraint violating condition storer are satisfied. The above obtained variable value combination satisfying none of the constraint violating conditions is the solution to the constrained combination satisfaction problem or the constrained combination optimization problem.
    • 基于计算机的组合问题处理器解决了约束组合满足问题,用于确定各个变量的离散值,其中约束由一组不等式和等式从外部指定,并且解决用于确定各个变量的离散值以最小化或最大化的组合优化问题 给定目标函数的值。 计算机包括违反不平等创造者的初始约束,用于创建约束违反与不平等组相反的不等式; 用于更改可变值以检查会议约束的变量值更改器; 用于选择值未知的变量的值的变量选择器; 约束违反条件创建者,用于通过数字化出现在违反由违反不等式的约束条件创建的条件的约束中的变量来创建通过简化不等式的逻辑积获得的新约束违反条件,当没有一个值满足由进程产生的约束时 变量值更改器或变量值选择器。 约束违反条件存储器存储由约束违反条件创建者创建的违反条件的约束。 改变或选择可变值,使得不存在违反条件存储器中违反条件​​的条件违反条件。 上述得到的满足任何违约条件的可变值组合是约束组合满足问题或约束组合优化问题的解。