首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   55篇
  免费   0篇
电工技术   2篇
建筑科学   1篇
无线电   2篇
一般工业技术   5篇
冶金工业   33篇
自动化技术   12篇
  2021年   1篇
  2016年   1篇
  2015年   1篇
  2014年   2篇
  2013年   4篇
  2012年   1篇
  2010年   1篇
  2009年   4篇
  2006年   1篇
  2002年   1篇
  2001年   1篇
  1999年   1篇
  1996年   7篇
  1995年   8篇
  1994年   3篇
  1993年   3篇
  1992年   3篇
  1991年   3篇
  1989年   4篇
  1988年   4篇
  1981年   1篇
排序方式: 共有55条查询结果,搜索用时 0 毫秒
51.
Massive ascites associated with pelvic endometriosis is an unusual occurrence. Two cases recently encountered by the authors are presented, and 7 additional cases from the literature are reviewed. Clinical courses and operative findings are described, and the management of the cases is presented. The etiology of ascites is explored and the possibility of conservative surgery and hormonal control with danazol is discussed.  相似文献   
52.
A matching in a graph is a set of edges no two of which share a common vertex. In this paper we introduce a new, specialized type of matching which we call uniquely restricted matchings, originally motivated by the problem of determining a lower bound on the rank of a matrix having a specified zero/ non-zero pattern. A uniquely restricted matching is defined to be a matching M whose saturated vertices induce a subgraph which has only one perfect matching, namely M itself. We introduce the two problems of recognizing a uniquely restricted matching and of finding a maximum uniquely restricted matching in a given graph, and present algorithms and complexity results for certain special classes of graphs. We demonstrate that testing whether a given matching M is uniquely restricted can be done in O(|M||E|) time for an arbitrary graph G=(V,E) and in linear time for cacti, interval graphs, bipartite graphs, split graphs and threshold graphs. The maximum uniquely restricted matching problem is shown to be NP-complete for bipartite graphs, split graphs, and hence for chordal graphs and comparability graphs, but can be solved in linear time for threshold graphs, proper interval graphs, cacti and block graphs. Received April 12, 1998; revised June 21, 1999.  相似文献   
53.
Programmers often write code to prototype, ideate, and discover. To do this, they work opportunistically, emphasizing speed and ease of development over code robustness and maintainability. How do opportunistic programmers make these trade-offs, and how does their work's structure compare to more formal software engineering practices? Opportunistic programmers build software using high-level tools and often add new functionality via copy-and-paste from the Web. They iterate rapidly, consider code impermanent, and find debugging particularly challenging. Five opportunistic-programming principles can help guide the development of tools that explicitly support prototyping in code.  相似文献   
54.
55.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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