搜索资源列表
NProtector
- NP保护方面的知识，感兴趣的多看看，有帮助的-NP protection of the knowledge, interest see more help
060105
- 时间表问题是NP完全的，因此很难寻求一个有效的整体优化算法，分组作为重要的油画策略
np_x11
- 三星np x11笔记本电脑原理图,欢迎下载.我还有其它的,如有需要,我再上传.
最大团问题的各种算法和源代码
- 最大团问题（Maximum Clique Problem, MCP）是图论中一个经典的组合优化问题，也是一类NP完全问题，在国际上已有广泛的研究，而国内对MCP问题的研究则还处于起步阶段，因此，研究最大团问题具有较高的理论价值和现实意义。 最大团问题又称为最大独立集问题（Maximum Independent Set Problem），在市场分析、方案选择、信号传输、计算机视觉、故障诊断等领域具有非常广泛的应用。目前，求解MCP问题的算法主要分为两类：确定性算法和启发式算法。确定性算法有回溯法
Garey---Computers-and-Intractability---A-Guide-to
- Garey - Computers and Intractability - A Guide to NP-Completene-Garey - Computers and Intractability - A Guide to NP-Completeness
3SAT-NP-Completeness
- Proff of the NP-Completeness of the 3-SAT problem
Using-Genetic-Algorithms-to-Solve-NP-Complete-Pro
- Using Genetic Algorithms to Solve NP-Complete Problems
TSP
- 免疫算法和模拟退火算法求解TSP问题的研究 本文提出了一种新的免疫模拟退火算法，并将其应用于求解典型的NP问题—TSP问题 -Immune algorithm and simulated annealing algorithm for solving TSP problems is proposed in this paper a new immune simulated annealing algorithm, and applies it to solve the issue of
earchonVehicleDitributioProbleBasedoGenetiAlgorith
- The vehicle distribution problem has been a NP problem for a long time it can not reach a most optimized state. Because of the multi- factors that should be considered about the vehicle distribution problem such as the carrying capacity, sources an
393_NP
- 汇集各种过NP保护的资料，希望对大家有用-NP have been brought together to protect a variety of information useful for all of us hope
NPStartTrendandDesignDemand
- NP的起源以及发展， 以及简要功能介绍 和开发的准备-The origin and the development of NP, as well as a brief introduction and development functions to prepare
GoodsAllocatingProblemwithMultiAimsbasedonTheHybri
- 多目标货物配装问题是一个复杂的组合优化问题，属于NP难问题，本文用混合粒子群算法求解多目标货物配装问题。混合粒子群算法在基本粒子群算法的基础上，通过引进遗传算法中的交叉和变异的策略，避免了陷入局部最优，加快了达到全局最优的收敛速度。此外，本文提出用权重系数来平衡各目标使各目标都能达到相对较优的效果。-Multi-objective loading of goods is a complicated combinatorial optimization problems are NP hard p
NPC_Problem
- 经典NP-hard问题的描述以及到2003年为止问题被解决的程度-classic NP-hard problems
lect11-07
- A lecture on NP-hard optimization
WebKit_PluginProgTopic.pdf
- NetScape Plugin 接口编程说明文档，适用于所有支持NetScape的浏览器 -NetScape Plugin interface docment. can be used for all Browsers which support NP
Approximation_Algorithms_for_NP-Hard_Problems
- NP hard problems aproximation algorithm
Herlihy_MultiprProgram.pdf
- This book is intended to serve both as a textbook for a senior-level undergraduate course, and as a reference for practitioners. Readers should know enough discrete mathematics to understand “big-O” notation, and what it means for a problem to be NP-
OPNET-simulation-of-SCPS-NP
- 通过OPNET 通信仿真软件进行建模，基本实现了SCPS-NP 协议要求的功能，对协议的性能进行了分析-designing a simulation method of SCPS_NP protocol based on opnet
np
- some network programming examples that support understanding of np
NP-complete
- 数论算法，NP-完全性不能在合理的时间内求得问题的解-Number theory algorithms, NP-completeness can not be obtained within a reasonable time solution of the problem