首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   103篇
  免费   9篇
  国内免费   1篇
化学   82篇
晶体学   1篇
力学   5篇
数学   13篇
物理学   12篇
  2021年   3篇
  2020年   2篇
  2019年   2篇
  2018年   3篇
  2016年   1篇
  2015年   2篇
  2014年   8篇
  2013年   8篇
  2012年   9篇
  2011年   12篇
  2010年   7篇
  2009年   4篇
  2008年   9篇
  2007年   5篇
  2006年   7篇
  2005年   9篇
  2004年   2篇
  2003年   3篇
  2002年   2篇
  2001年   1篇
  1999年   1篇
  1997年   2篇
  1995年   1篇
  1993年   1篇
  1992年   2篇
  1991年   3篇
  1990年   1篇
  1988年   1篇
  1967年   1篇
  1963年   1篇
排序方式: 共有113条查询结果,搜索用时 15 毫秒
111.
Mette Andresen  Lena Lindenskov 《ZDM》2009,41(1-2):213-222
A new concept, compulsory multi-disciplinary courses, was introduced in upper secondary school curriculum as a central part of a recent reform. This paper reports from a case study of such a triple/four-disciplinary project in mathematics, physics, chemistry and ‘general study preparation’ performed under the reform by a team of experienced teachers. The aim of the case study was to inquire how the teachers met the demands of the introduction of this new concept and, to look for signs of new relations established by the students between mathematics and other subjects, as a result of the multi-disciplinary teaching. The study revealed examples of good practice in planning and teaching. In addition, it served to illuminate interesting aspects of how students perceived the school subject mathematics and its relations to other subjects and to common sense.  相似文献   
112.
The Multi-Commodity $k$ -splittable Maximum Flow Problem consists of maximizing the amount of flow routed through a network such that each commodity uses at most $k$ paths and such that edge capacities are satisfied. The problem is $\mathcal NP $ -hard and has application in a.o. telecommunications. In this paper, a local search heuristic for solving the problem is proposed. The heuristic is an iterative shortest path procedure on a reduced graph combined with a local search procedure to modify certain path flows and prioritize the different commodities. The heuristic is tested on benchmark instances from the literature and solves 83 % of the instances to optimality. For the remaining instances, the heuristic finds good solution values which on average are 1.04 % from the optimal. The heuristic solves all instances in less than a second. Compared to other heuristics, the proposed heuristic again shows superior performance with respect to solution quality.  相似文献   
113.
The issue of finding market clearing prices in markets with non-convexities has had a renewed interest due to the deregulation of the electricity sector. In the day-ahead electricity market, equilibrium prices are calculated based on bids from generators and consumers. In most of the existing markets, several generation technologies are present, some of which have considerable non-convexities, such as capacity limitations and large start-up costs. In this paper we present equilibrium prices composed of a commodity price and an uplift charge. The prices are based on the generation of a separating valid inequality that supports the optimal resource allocation. In the case when the sub-problem generated as the integer variables are held fixed to their optimal values possess the integrality property, the generated prices are also supported by non-linear price functions that are the basis for integer programming duality.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号