全文获取类型
收费全文 | 448篇 |
免费 | 2篇 |
专业分类
力学 | 1篇 |
数学 | 411篇 |
物理学 | 38篇 |
出版年
2023年 | 1篇 |
2022年 | 6篇 |
2021年 | 3篇 |
2020年 | 4篇 |
2019年 | 6篇 |
2018年 | 10篇 |
2017年 | 6篇 |
2015年 | 5篇 |
2014年 | 31篇 |
2013年 | 42篇 |
2012年 | 39篇 |
2011年 | 45篇 |
2010年 | 44篇 |
2009年 | 46篇 |
2008年 | 25篇 |
2007年 | 38篇 |
2006年 | 12篇 |
2005年 | 7篇 |
2004年 | 4篇 |
2003年 | 3篇 |
2002年 | 4篇 |
2001年 | 2篇 |
2000年 | 4篇 |
1999年 | 2篇 |
1998年 | 6篇 |
1997年 | 3篇 |
1996年 | 10篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 6篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 4篇 |
排序方式: 共有450条查询结果,搜索用时 15 毫秒
141.
This paper proposes to rely on power indices to measure the amount of control held by individual shareholders in corporate networks. The value of the indices is determined by a complex voting game viewed as the composition of interlocked weighted majority games; the compound game reflects the structure of shareholdings. The paper describes an integrated algorithmic approach which allows to deal efficiently with the complexity of computing power indices in shareholding networks, irrespective of their size or structure. In particular, the approach explicitly accounts for the presence of float and of cyclic shareholding relationships. It has been successfully applied to the analysis of real-world financial networks. 相似文献
142.
143.
D.?Gómez E.?González-Arangüena C.?Manuel "mailto:conrado@estad.ucm.es " title= "conrado@estad.ucm.es " itemprop= "email " data-track= "click " data-track-action= "Email author " data-track-label= " ">Email author G.?Owen M.?del Pozo J.?Tejada 《Mathematical Methods of Operations Research》2004,59(3):479-489
A communication situation consists of a coalitional game and a graph, the nodes of the graph corresponding to the players of the game. To calculate the Myerson value for such situations, we obtain results which extend those well known for trees and cycle-complete graphs. On the other hand, in order to reduce the associated calculus for communication situations with a pure overhead game, the possibility of splitting the graph in several subgraphs is analyzed. For each fixed decomposition of the graph, a subspace of games compatible with this decomposition is given. 相似文献
144.
《Stochastics An International Journal of Probability and Stochastic Processes》2013,85(8):1190-1220
ABSTRACTGame (Israeli) options in a multi-asset market model with proportional transaction costs are studied in the case when the buyer is allowed to exercise the option and the seller has the right to cancel the option gradually at a mixed (or randomized) stopping time, rather than instantly at an ordinary stopping time. Allowing gradual exercise and cancellation leads to increased flexibility in hedging, and hence tighter bounds on the option price as compared to the case of instantaneous exercise and cancellation. Algorithmic constructions for the bid and ask prices, and the associated superhedging strategies and optimal mixed stopping times for both exercise and cancellation are developed and illustrated. Probabilistic dual representations for bid and ask prices are also established. 相似文献
145.
We present a game-theoretic approach to optimize the strategies of toll enforcement on a motorway network. In contrast to previous approaches, we consider a network with an arbitrary topology, and we handle the fact that users may choose their Origin-Destination path; in particular they may take a detour to avoid sections with a high control rate. We show that a Nash equilibrium can be computed with an LP (although the game is not zero-sum), and we give a MIP for the computation of a Stackelberg equilibrium. Experimental results based on an application to the enforcement of a truck toll on German motorways are presented. 相似文献
146.
The paper analyses the problem of coordination in supply networks of multiple retailers and a single supplier, where partners have asymmetric, private information of demand and costs. After stating generic requirements like distributedness, truthfulness, efficiency and budget balance, we use the apparatus of mechanism design to devise a coordination mechanism that guarantees the above properties in the network. The resulting protocol is a novel realisation of the widely used Vendor Managed Inventory (VMI) where the responsibility of planning is at the supplier. We prove that together with the required generic properties a fair sharing of risks and benefits cannot be guaranteed. We illustrate the general mechanism with a detailed discussion of a specialised version, assuming that inventory planning is done according to the newsvendor model, and explore the operation of this protocol through computational experiments. 相似文献
147.
The explosion of mobile traffic and highly dynamic property often make it increasingly stressful for a cellular service provider to provide sufficient cellular spectrum resources to support the dynamic change of traffic demand in a day. In this paper, considering the dynamic characteristic of the cellular network traffic demand, we not only proposed an optimal, truthful reverse auction incentive framework, but also proposed a valuation function which is based on third-party access points’ capacity. We consider spectrum sharing in a third-party network where several secondary users (SUs) share spectrum with a primary user (PU). A leakage-based beamforming algorithm is proposed via game theory to maximize the sum utility of third-party access points subject to the signal-to-leakage-and-noise (SLNR) constraint of SUs and PU interference constraint. The sum throughput maximization problem is formulated as a non-cooperative game, where the SUs compete with each other over the resources. Nash equilibrium is considered as the solution of this game. Simulation results show that the proposed algorithm can achieve a high sum throughput and converge to a locally optimal beamforming vector. 相似文献
148.
A basic characteristic of most opinion models is that people tend to agree or compromise in the opinion interaction, which could be hopefully described by cooperative games in the evolutionary game theory framework. This paper presents game theory methods to model the formation of binary opinions: cooperative games are proposed to model the interaction rules of general people who tend to find an agreement; minority games are proposed to model the behaviors of contrarians; opinion preference is considered by varying the payoff values. The Majority Voter model could be restored from the proposed games. The game theory models show evolutionary results similar to traditional opinion models. Specially, the evolution of opinions with consideration of contrarians is in accordance with the Galam model. Furthermore, influences of evolving rule, network topology and initial distribution of opinions are studied through numerical simulations. Discussions about methods to promote or hinder the consensus state at the best equilibrium point are given. 相似文献
149.
In this paper, we present a model of social interaction systems. By comparing it with existing analytical models, and using simulations, we focus on dynamical behavior and interaction properties of this nonlinear time-varying system. The system's behavior can be predicted if we have sufficient knowledge of system parameters such as the connection matrix. Observation of system behavior can be useful to recover the unknown or insufficiently known levels of interaction strength. Furthermore, if proper sampling can be carried out, the system can be identified. This model is suitable for investigating social phenomena such as the fashion phenomenon. 相似文献
150.
We use the Minority Game as a testing frame for the problem of the emergence of diversity in socio-economic systems. For the MG with heterogeneous impacts, we show that the direct generalisation of the usual agents’ profit does not fit some real-world situations. As a typical example we use the traffic formulation of the MG. Taking into account vehicles of various lengths it can easily happen that one of the roads is crowded by a few long trucks and the other contains more drivers but still is less covered by vehicles. Most drivers are in the shorter queue, so the majority win. To describe such situations, we generalised the formula for agents’ profit by explicitly introducing a utility function depending on an agent’s impact. Then, the overall profit of the system may become positive depending on the actual choice of the utility function. We investigated several choices of the utility function and showed that this variant of the MG may turn into a positive sum game. 相似文献