全文获取类型
收费全文 | 81篇 |
免费 | 1篇 |
国内免费 | 3篇 |
专业分类
化学 | 1篇 |
力学 | 1篇 |
综合类 | 2篇 |
数学 | 76篇 |
物理学 | 5篇 |
出版年
2022年 | 1篇 |
2021年 | 3篇 |
2020年 | 1篇 |
2017年 | 4篇 |
2015年 | 1篇 |
2014年 | 1篇 |
2013年 | 5篇 |
2011年 | 5篇 |
2010年 | 3篇 |
2009年 | 6篇 |
2008年 | 2篇 |
2007年 | 10篇 |
2006年 | 5篇 |
2005年 | 8篇 |
2004年 | 3篇 |
2003年 | 1篇 |
2002年 | 5篇 |
2001年 | 4篇 |
2000年 | 1篇 |
1998年 | 2篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1985年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有85条查询结果,搜索用时 15 毫秒
51.
This paper gives a rigorous definition of a stage, usable for dynamic stochastic programs with both recourse and probabilistic constraints. Algebraic modelling languages can make use of this definition for automatic consistency checks. 相似文献
52.
53.
We correct a mistake in the paper “Generalized periodicity and primitivity for words” [4] and justify the existence of regular languages all of whose roots are not even context‐sensitive. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
54.
基于XML的软件体系结构描述方法 总被引:1,自引:0,他引:1
介绍了当前软件体系结构描述语言法与概念框架领域中存在的问题,并探讨了使用扩展标记语言ML来表述软件体系结构作为解决办法的可行性,在借助可交换的体系结构描述语言ACME作为桥梁的基础上,实现了用XML表述的软件体系结构。 相似文献
55.
Jawad Abrache Teodor Gabriel Crainic Michel Gendreau Monia Rekik 《Annals of Operations Research》2007,153(1):131-164
Combinatorial auctions are an important class of market mechanisms in which participants are allowed to bid on bundles of
multiple heterogeneous items. In this paper, we discuss several complex issues that are encountered in the design of combinatorial
auctions. These issues are related to the formulation of the winner determination problem, the expression of combined bids,
the design of progressive combinatorial auctions that require less information revelation, and the need for decision support
tools to help participants make profitable bidding decisions. For each issue, we survey the existing literature and propose
avenues for further research.
An earlier version of this paper appeared in 4OR 2, 1–33, 2004. 相似文献
56.
Computer-assisted model analysis, verification, and debugging is growing in importance. Most mathematical programming systems provide some debugging tools. This paper describes a typical structural analysis problem encountered in optimization models formulated in planning languages and states results that are useful in resolving it.This research was partially supported by ONR Contract No. N00014-78-C-0222. 相似文献
57.
Maciej Kandulski 《Mathematical Logic Quarterly》1993,39(1):103-114
We show that derivations in the nonassociative and commutative Lambek calculus with product can be transformed to a normal form as it is the case with derivations in noncommutative calculi. As an application we obtain that the class of languages generated by categorial grammars based on the nonassociative and commutative Lambek calculus with product is included in the class of CF-languages. MSC: 68Q50, 03D15, 03B65. 相似文献
58.
A new syntactic model, called pure two-dimensional (2D) context-free grammar (P2DCFG), is introduced based on the notion of pure context-free string grammar. The rectangular picture generative power of this 2D grammar model is investigated. Certain closure properties are obtained. An analogue of this 2D grammar model called pure 2D hexagonal context-free grammar (P2DHCFG) is also considered to generate hexagonal picture arrays on triangular grids. 相似文献
59.
Partial words are strings over a finite alphabet that may contain a number of “do not know” symbols. In this paper, we consider the period and weak period sets of partial words of length n over a finite alphabet, and study the combinatorics of specific representations of them, called correlations, which are binary and ternary vectors of length n indicating the periods and weak periods. We characterize precisely which vectors represent the period and weak period sets of partial words and prove that all valid correlations may be taken over the binary alphabet. We show that the sets of all such vectors of a given length form distributive lattices under suitably defined partial orderings. We show that there is a well-defined minimal set of generators for any binary correlation of length n and demonstrate that these generating sets are the primitive subsets of {1,2,…,n−1}. We also investigate the number of partial word correlations of length n. Finally, we compute the population size, that is, the number of partial words sharing a given correlation, and obtain recurrences to compute it. Our results generalize those of Guibas, Odlyzko, Rivals and Rahmann. 相似文献
60.
《Operations Research Letters》2020,48(4):446-451
In display advertising auctions, a unique display opportunity may trigger many bid requests being sent to the same buyer. Bid request duplication is an issue: programmatic bidding agents might bid against themselves. In a simplified setting of unified second-price auctions, the optimal solution for the bidder is to randomize the bid, which is quite unusual. Our results motivate the recent switch to a unified first-price auction by showing that a unified second-price auction could have been detrimental to all participants. 相似文献