全文获取类型
收费全文 | 144篇 |
免费 | 26篇 |
专业分类
化学 | 6篇 |
力学 | 1篇 |
综合类 | 7篇 |
数学 | 145篇 |
物理学 | 11篇 |
出版年
2023年 | 2篇 |
2022年 | 6篇 |
2021年 | 6篇 |
2020年 | 5篇 |
2019年 | 5篇 |
2018年 | 8篇 |
2017年 | 3篇 |
2016年 | 10篇 |
2015年 | 3篇 |
2014年 | 11篇 |
2013年 | 10篇 |
2012年 | 5篇 |
2011年 | 11篇 |
2010年 | 4篇 |
2009年 | 10篇 |
2008年 | 19篇 |
2007年 | 11篇 |
2006年 | 9篇 |
2005年 | 7篇 |
2004年 | 5篇 |
2003年 | 4篇 |
2002年 | 3篇 |
2001年 | 2篇 |
1999年 | 1篇 |
1998年 | 5篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1986年 | 1篇 |
1982年 | 1篇 |
排序方式: 共有170条查询结果,搜索用时 15 毫秒
11.
Cristina Bazgan W. Fernandez de la Vega Marek Karpinski 《Random Structures and Algorithms》2003,23(1):73-91
It is known that large fragments of the class of dense Minimum Constraint Satisfaction (MIN‐CSP) problems do not have polynomial time approximation schemes (PTASs) contrary to their Maximum Constraint Satisfaction analogs. In this paper we prove, somewhat surprisingly, that the minimum satisfaction of dense instances of kSAT ‐formulas, and linear equations mod 2, Ek‐LIN2, do have PTASs for any k. The MIN‐Ek‐LIN2 problems are equivalent to the k‐ary versions of the Nearest Codeword problem, the problem which is known to be exceedingly hard to approximate on general instances. The method of solution of the above problems depends on the development of a new density sampling technique for k‐uniform hypergraphs which could be of independent interest. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 23: 73–91, 2003 相似文献
12.
美容院顾客满意度影响因素的实证分析 总被引:1,自引:1,他引:0
本文通过对国内外美容行业现状的分析,以长沙市美容院顾客满意度的问卷调查结果为依据,利用统计研究的方法进行分析,得出了几个影响顾客满意度的关键因素,指出美容院行业在产品和销售服务等方面存在多种管理经营缺陷。 相似文献
13.
14.
15.
16.
17.
The goal programming (GP) model is probably the best known in mathematical programming with multiple objectives. Available in various versions, GP is one of the most powerful multiple objective methods which has been applied in much varied fields. It has also been the target of many criticisms among which are those related to the difficulty of determining precisely the goal values as well as those concerning the decision-maker's near absence in this modelling process. In this paper, we will use the concept of indifference thresholds for modelling the imprecision related to the goal values. Many classical imprecise and fuzzy GP model formulations can be considered as a particular case of the proposed formulation. 相似文献
18.
Graph Coloring with Adaptive Evolutionary Algorithms 总被引:4,自引:0,他引:4
This paper presents the results of an experimental investigation on solving graph coloring problems with Evolutionary Algorithms (EAs). After testing different algorithm variants we conclude that the best option is an asexual EA using order-based representation and an adaptation mechanism that periodically changes the fitness function during the evolution. This adaptive EA is general, using no domain specific knowledge, except, of course, from the decoder (fitness function). We compare this adaptive EA to a powerful traditional graph coloring technique DSatur and the Grouping Genetic Algorithm (GGA) on a wide range of problem instances with different size, topology and edge density. The results show that the adaptive EA is superior to the Grouping (GA) and outperforms DSatur on the hardest problem instances. Furthermore, it scales up better with the problem size than the other two algorithms and indicates a linear computational complexity. 相似文献
19.
Jan S. Krouwer 《Accreditation and quality assurance》2007,12(5):263-264
A recent editorial reviewed several definitions of quality. The limitations of these definitions are discussed here, with
a simple suggestion to define quality as meeting a specified error rate whereby the required elements for an error rate are
listed.
Papers published in this section do not necessarily reflect the opinion of the Editors, the Editorial Board and the Publisher. 相似文献
20.
Jeffrey C. Johnson Dawn L. Parks 《Computational & Mathematical Organization Theory》1998,4(3):223-239
Earlier research has shown a relationship between various forms of structural centrality and perceived leadership and role
satisfaction in small experimental groups. The limited amount of research on this topic in naturally occurring social networks
has yielded results that often conflict with one another. Different results have generally been attributed to possible differences
in task environments. This paper examines the relationship between two types of structural centrality and perceived influence,
role satisfaction, and perceived effectiveness in an environmental resource management program. Findings in this paper suggest
that the observed differences in relationships between the network and other variables is partly a function of global network
properties (e.g., marginality of subgroups) and related task environments.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献