注册会员 | 设为首页 | 加入收藏夹
您好，欢迎光临本网站！[请登录] ！[注册会员]！  

搜索资源列表

  1. Advanced Engineering Mathematics

  2. Review of Prerequisites 3 CHAPTER 1.1 Real Numbers, Mathematical Induction, and Mathematical Conventions 4 1.2 Complex Numbers 10 1.3 The Complex Plane 15 1.4 Modulus and Argument Representation of Complex Numbers 18 1.5 Roots of Complex Numbers 22

  3. 所属分类：硬件开发

    • 发布日期：2009-05-26
    • 文件大小：8388608
    • 提供者：osoon

  1. Matlab 7 - Programming.pdf

  2. 该书是系统介绍了MATLAB的所有function功能，可以说是一本programming大全，而且还是英文版，值得收藏，而且敝人还打印了一份，正在苦学之中…… Creating and Concatenating Matrices . . . . . . . . . . . . . . . . . . 1-3 Constructing a Simple Matrix . . . . . . . . . . . . . . . . . . . . . . . . . . 1-4 Special

  3. 所属分类：其它

    • 发布日期：2009-06-11
    • 文件大小：4194304
    • 提供者：xiaogangmath

  1. PROBABILISTIC COMBINATORIAL OPTIMIZATION

  2. We address the problem of evaluating the expected optimal objective value of a 0-1 optimization problem under uncertainty in the objective coefficients. The probabilistic model we consider prescribes limited marginal distribution information for the

  3. 所属分类：物流

    • 发布日期：2013-03-20
    • 文件大小：248832
    • 提供者：wanwanhzy

  1. Boolean.Functions.and.Computation.Models,.Clote,.Kranakis,.Springer,.2002

  2. This textbook presents a survey of research on boolean functions, circuits, parallel computation models, function algebras, and proof systems. Its main aim is to elucidate the structure of "fast" parallel computation. The complexity of parallel comp

  3. 所属分类：专业指导

    • 发布日期：2013-06-05
    • 文件大小：7340032
    • 提供者：fetag

  1. Limits to Parallel Computation

  2. This book is an introduction to the rapidly growing theory of P completeness — the branch of complexity theory that focuses on identifying the “hardest” problems in the class P of problems solvable in polynomial time. P -complete problems are of int

  3. 所属分类：专业指导

    • 发布日期：2013-06-05
    • 文件大小：1048576
    • 提供者：fetag

  1. [Book]Theory of Computational Complexity

  2. A complete treatment of fundamentals and recent advances in complexity theory Complexity theory studies the inherent difficulties of solving algorithmic problems by digital computers. This comprehensive work discusses the major topics in complexity

  3. 所属分类：讲义

    • 发布日期：2014-09-29
    • 文件大小：3145728
    • 提供者：laoqianhouzhong

  1. An Experimental Comparison of Min-Cut/Max-Flow Algorithms

  2. 最大流/最小割算法的简介，理解常用最大流最小割概念的文献，值得学习。 minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision. The combinatorial optimization literature provides many min-cut

  3. 所属分类：讲义

    • 发布日期：2016-08-24
    • 文件大小：3145728
    • 提供者：ilovejohnny

  1. SPIN经典论文集-第11届SPIN workshop论文集

  2. Invited Paper Formal Analysis of Processor Timing Models Reinhard Wilhelm 1 Heuristics and Probabilities Typical Structural Properties of State Spaces Radek Pelánek 5 State Caching Reconsidered Jaco Geldenhuys 23 Directed Error Detection in C++ with

  3. 所属分类：C

    • 发布日期：2008-12-18
    • 文件大小：6291456
    • 提供者：ding

  1. On Extending Semantic Matchmaking to Include Preconditions and Effects.pdf

  2. Central to the notion of dynamic binding and loose coupling that underlie service-oriented architectures is dynamic service discovery. At the heart of most service discovery mechanisms is a matchmaking algorithm that matches a semantic query to a se

  3. 所属分类：Web开发

    • 发布日期：2009-03-27
    • 文件大小：340992
    • 提供者：wurongxin

  1. discrete event systems

  2. A polynomial-time algorithm for diagnosability verification of discrete event systems

  3. 所属分类：机器学习

    • 发布日期：2018-07-14
    • 文件大小：652288
    • 提供者：qq_21894771

  1. Interior methods for nonlinear optimization

  2. Interior methods are an omnipresent, conspicuous feature of the constrained optimization landscape today, but it was not always so. Primarily in the form of barrier methods, interior-point techniques were popular during the 1960s for solving nonline

  3. 所属分类：专业指导

    • 发布日期：2018-11-20
    • 文件大小：1048576
    • 提供者：yangfanhuashui

  1. The Complexity of Theorem-Proving Procedures

  2. It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced” means, roughly speaking,

  3. 所属分类：其它

    • 发布日期：2019-05-07
    • 文件大小：112640
    • 提供者：weixin_45026140

  1. Approximation Algorithms.rar

  2. Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that P -=/= NP, their exact solution is prohibitively time consuming. Charting the landscape of a

  3. 所属分类：互联网

    • 发布日期：2020-04-26
    • 文件大小：7340032
    • 提供者：MyLinChi

  1. knapsack.pdf

  2. 背包问题近似算法PTAS和FPTAS. 原文题目: The Knapsack Problem and Fully Polynomial Time Approximation Schemes (FPTAS). 作者: Katherine Lai, Prof. M. X. Goemans

  3. 所属分类：讲义

    • 发布日期：2020-04-21
    • 文件大小：95232
    • 提供者：qx3501332

  1. 整数规划的花授粉算法

  2. 整数规划是NP困难（Non-deterministic Polynomial-time hard，NP-hard）的经典问题之一。整数规划的花授粉算法（Integer Flower Pollination Algorithm，IFPA）是采用截断取整的方法，将最近开发的花授粉算法（Flower Pollination Algorithm，FPA）扩展到求解整数规划问题。通过对测试函数集进行仿真实验，结果表明IFPA拥有很好的性能和很强的全局寻优能力，可以作为一种实用方法用于求解无约束整数规划和有

  3. 所属分类：其它

    • 发布日期：2020-10-16
    • 文件大小：436224
    • 提供者：weixin_38750406

  1. Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a

  2. In this paper, it is investigated how to sequence jobs with fuzzy processing times and predict their due dates on a single machine such that the total weighted possibilistic mean value of the weighted earliness–tardiness costs is minimized. First, an

  3. 所属分类：其它

    • 发布日期：2021-02-11
    • 文件大小：1048576
    • 提供者：weixin_38746442

  1. Stability analysis for a general class ofdiscrete-time polynomial fuzzy dynamic systems

  2. Stability analysis for a general class ofdiscrete-time polynomial fuzzy dynamic systems

  3. 所属分类：其它

    • 发布日期：2021-02-11
    • 文件大小：196608
    • 提供者：weixin_38526225

  1. Algorithmic Solutions for Envy-Free Cake Cutting

  2. We study the problem of finding an envy-free allocation of a cake to d + 1 players using d cuts. Two models are considered, namely, the oracle-function model and the polynomial-time function model. In the oracle-function model, we are interested in t

  3. 所属分类：其它

    • 发布日期：2021-02-09
    • 文件大小：521216
    • 提供者：weixin_38714910

  1. Optimal Configuration of Dispersion Compensation Modules with Installation Limits

  2. Selecting a cost optimum subset of discrete-value dispersion compensation modules (DV-DCMs) subject to maximum module count from an available set of DV-DCMs is a NP-hard problem. We derive a novel dynamic programming algorithm with pseudo-polynomial

  3. 所属分类：其它

    • 发布日期：2021-02-08
    • 文件大小：939008
    • 提供者：weixin_38674883

  1. 张博-An Efficient Polynomial Time Algorithm for a class.pdf

  2. 经典线性乘积问题完全多项式时间近似算法启蒙文献

  3. 所属分类：系统安全

    • 发布日期：2021-02-01
    • 文件大小：361472
    • 提供者：qq_27561295
« 1 23 4 »