全文获取类型
收费全文 | 195篇 |
免费 | 66篇 |
国内免费 | 11篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 3篇 |
2020年 | 5篇 |
2019年 | 3篇 |
2018年 | 8篇 |
2017年 | 22篇 |
2016年 | 14篇 |
2015年 | 7篇 |
2014年 | 13篇 |
2013年 | 17篇 |
2012年 | 22篇 |
2011年 | 15篇 |
2010年 | 15篇 |
2009年 | 17篇 |
2008年 | 13篇 |
2007年 | 13篇 |
2006年 | 14篇 |
2005年 | 13篇 |
2004年 | 4篇 |
2003年 | 5篇 |
2002年 | 5篇 |
2001年 | 12篇 |
2000年 | 4篇 |
1999年 | 4篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有272条查询结果,搜索用时 675 毫秒
1.
本文求解如下的组合对策问题:设有一堆棋子,总数N 是奇数,甲乙两人轮流取子,每人每次可取一颗、二颗,最多可取s 颗,但不能不取,直至取完后分别来数甲乙两人所取棋子的总数,总数为奇数者获胜。站在甲的立场上考虑获胜的策略,文中解决了如下两个问题:(Ⅰ)总数N 应是什么样的奇数,甲才有获胜策略;(Ⅱ)当N 一定时,甲应采取什么样的策略取子,才能获胜。 相似文献
2.
使用对策论的观点和方法 ,结合搜索论的知识 ,建立了一类搜索 -规避对抗对策模型 .对模型的结论做了系统分析 ,考虑了对策双方的最优策略及使用 . 相似文献
3.
研究了形如X'(t)∈-Ax(t)+F(t,x(t)),0≤t≤T,X(0)=x0的微分包含解的存在的局部性和整体性的结果,并在某种条件下研究了解的稳定性。 相似文献
4.
A. Garnaev 《海军后勤学研究》2007,54(1):109-114
This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λi (μi) for Player 1 (Player 2) such that pi(1 ? exp(?λixi)) (pi(1 ? exp(?μiyi))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort xi (yi) applied at point i where pi ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q1 and Player 2 gets q2 where q1 + q2 ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
5.
Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
6.
分析了RSA和DES的算法优点和安全弱点,设计了一个新的密码算法方案。该方案以类FEISTEL结构为基础增强了左右两半部分结构的安全设计,利用了RSA进行密钥分配,并以序列密码算法的生成原理改变了固定密钥的缺点。该新方案具有一次一密的特点,给破译者获得大量的明密文对造成了很大的困难,可较好地抵抗差分分析与线性分析,是一种安全性较强的加密方案。 相似文献
7.
Under quasi‐hyperbolic discounting, the valuation of a payoff falls relatively rapidly for earlier delay periods, but then falls more slowly for longer delay periods. When the salespersons with quasi‐hyperbolic discounting consider the product sale problem, they would exert less effort than their early plan, thus resulting in losses of future profit. We propose a winner‐takes‐all competition to alleviate the above time inconsistent behaviors of the salespersons, and allow the company to maximize its revenue by choosing an optimal bonus. To evaluate the effects of the competition scheme, we define the group time inconsistency degree of the salespersons, which measures the consequence of time inconsistent behaviors, and two welfare measures, the group welfare of the salespersons and the company revenue. We show that the competition always improves the group welfare and the company revenue as long as the company chooses to run the competition in the first place. However, the effect on group time inconsistency degree is mixed. When the optimal bonus is moderate (extreme high), the competition motivates (over‐motivates) the salesperson to work hard, thus alleviates (worsens) the time inconsistent behaviors. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 357–372, 2017 相似文献
8.
We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation. 相似文献
9.
10.
针对网络攻防环境中防御方以提高系统生存能力为目的所进行的最优生存防御策略的选取问题,提出了一种基于完全信息动态博弈理论的生存防御策略优化配置算法。将恶意攻击方、故障意外事件及防御方作为博弈的参与人,提出了一种混合战略模式下的三方动态博弈模型,对博弈的主要信息要素进行了说明,以混合战略纳什均衡理论为基础,将原纳什均衡条件式的表达式转化为可计算数值结果的表达式,并据此增加了近似的概念,最后,将提出的模型和近似纳什均衡求解算法应用到一个网络实例中,结果证明了模型和算法的可行性和有效性。 相似文献