搜索资源列表
最大团问题的各种算法和源代码
- 最大团问题（Maximum Clique Problem, MCP）是图论中一个经典的组合优化问题，也是一类NP完全问题，在国际上已有广泛的研究，而国内对MCP问题的研究则还处于起步阶段，因此，研究最大团问题具有较高的理论价值和现实意义。 最大团问题又称为最大独立集问题（Maximum Independent Set Problem），在市场分析、方案选择、信号传输、计算机视觉、故障诊断等领域具有非常广泛的应用。目前，求解MCP问题的算法主要分为两类：确定性算法和启发式算法。确定性算法有回溯法
IPL-kls-mcp
- An Eff ective Local Search for the Maximum Clique Problem
s71pl-j_00_a11_e
- S71PL-J Based MCPs Stacked Multi-Chip Product (MCP) Flash Memory
11195c
- It s datasheet of IC MCP 42XXX or 42-It s datasheet of IC MCP 42XXX or 42XXX
mpc3204
- this a datashit of mcp 3204/3208 (12 bit spi adc).-this is a datashit of mcp 3204/3208 (12 bit spi adc).
MCP2200
- Microchip公司的串口通讯适配器使用说明-MCP 2200
22058c
- descr iption for mppt algorithm for mcp component
R8M_DataSheet_V02
- This document describes the application information of R8M Module that includes Allwinner Tech’s high performance processer R8 and 64Gb NAND Flash/4Gb DDR3 memory MCP. R8M is highly integrated, low power consumption, lower system cost module, which i
A13-Brief
- This document describes the application information of R8M Module that includes Allwinner Tech’s high performance processer R8 and 64Gb NAND Flash/4Gb DDR3 memory MCP. R8M is highly integrated, low power consumption, lower system cost module, which i
Samsung Memory Datasheet
- Samsung 1GB+256M MCP Memory datasheet。