会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 9. 发明申请
    • EFFICIENT STORAGE OF INDIVIDUALS FOR OPTIMIZATION SIMULATION
    • 有效存储个人优化模拟
    • US20120130928A1
    • 2012-05-24
    • US12948850
    • 2010-11-18
    • Robert H. Bell, JR.Jason F. Cantin
    • Robert H. Bell, JR.Jason F. Cantin
    • G06N3/12G06F15/18
    • G06N3/126
    • Candidate solutions to an optimization problem comprise a set of potential values that can be applied to variables in a problem description. Candidate solutions can be large because of the complexity of optimization problems and large number of variables. The populations of candidate solutions may also be large to ensure diversity and effectiveness in computing a solution. When the populations and the candidate solutions are large for an optimization problem, computing a solution to the optimization problem consumes a large amount of memory. In some instances, several generations of candidate solutions are stored in memory. Compression of the candidate solutions can minimize the memory space consumed to compute a solution to an optimization problem.
    • 优化问题的候选解决方案包括可以应用于问题描述中的变量的一组潜在值。 候选解决方案可能很大,因为优化问题和大量变量的复杂性。 候选解决方案的人数也可能很大,以确保计算解决方案的多样性和有效性。 当人口和候选解决方案对于优化问题很大时,计算优化问题的解决方案会消耗大量的内存。 在某些情况下,几代候选解决方案存储在内存中。 压缩候选解决方案可以最大限度地减少计算优化问题解决方案所消耗的内存空间。