1) distributed constraint satisfaction problem
分布约束满足问题
2) DCSP
分布式约束满足问题
1.
The research of Distributed Constraint Satisfaction Problem(DCSP) and Distributed Constraint Optimization Problem (DCOP) have already became one of the most important basic research topic in distributed artificial intelligence domain.
分布式约束满足问题(DCSP)和分布式约束最优问题(DCOP)的研究是分布式人工智能领域的基础性工作。
3) graded constraint satisfaction problem(GCSP)
分级约束满足问题
1.
The graded constraint satisfaction problem(GCSP) is put forward by analyzing the characteristic and function of constraint in configuration design.
从分析配置设计过程中约束对变量的不同作用程度入手,提出将配置求解过程作为分级约束满足问题进行处理,对约束进行分级处理,赋予不同的约束水平,以确定配置求解过程中约束满足的顺序。
4) GCSP network
分级约束满足问题网络
1.
By introducing "active variable" and "active constraint" to endow the vertex and arc of direction graph with new meanings,GCSP network is established.
通过引入"活动变量"和"活动约束",对有向图中结点和弧赋予新的含义,构建了分级约束满足问题网络,采用一致性方法和基于图的传播技术相结合的方法进行网络的一致性检验和约束的传播,并提出了分级约束满足问题网络在求解过程中约束冲突的解决方法,形成了配置设计的分级约束满足问题求解方法,较好地解决了变量受多个不同强度约束条件作用时的合理赋值和约束冲突的问题。
5) partial constraint satisfaction problem
部分约束满足问题
1.
In such a situation, the problem can be transformed to a partial constraint satisfaction problem to be resolved.
此时问题求解可以转化为一类部分约束满足问题来处理,相应的优化目标是最小化未访问顾客的损失和。
6) constraint satisfaction problems
约束满足问题
1.
Research on Discrete Particle Swarm Algorithm for Constraint Satisfaction Problems and Scheduling Problems;
约束满足问题与调度问题中离散粒子群算法研究
2.
Non-binary constraint satisfaction problems (NB-CSPs) are transformed into the integer constrained minimization problems by extending correlative definitions of E-GENET.
通过E-GENET的重定义,将非二元约束满足问题(NB-CSPs)转化为整数最小化问题,提出一类非二元变量约束关系的离散拉格朗日搜索模式(NB-LSDL)与算法,实现了基于NB-LSDL的E-GENET重构,为求解一般约束CSPs的最小冲突启发式修补方法提供新的理论依据,扩展了E-GENET处理问题的技术与手段。
3.
constraint satisfaction problems play a very important role in the area of artificial intelligence,while arc consistency is the key technique in solving such problems.
约束满足问题是人工智能研究领域的重要问题。
补充资料：分布
分布
distribution
营养物质、药物等通过血管壁而进入组织细胞的过程；或指病灶、病变在体内的定位分布。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条