咨询与建议

限定检索结果

文献类型

  • 1,927 篇 会议
  • 142 篇 期刊文献
  • 10 册 图书

馆藏范围

  • 2,079 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,295 篇 工学
    • 1,181 篇 计算机科学与技术...
    • 861 篇 软件工程
    • 225 篇 信息与通信工程
    • 169 篇 控制科学与工程
    • 129 篇 电气工程
    • 77 篇 电子科学与技术(可...
    • 73 篇 生物医学工程(可授...
    • 72 篇 生物工程
    • 40 篇 建筑学
    • 36 篇 动力工程及工程热...
    • 35 篇 机械工程
    • 34 篇 光学工程
    • 29 篇 仪器科学与技术
    • 29 篇 化学工程与技术
    • 27 篇 力学(可授工学、理...
    • 27 篇 土木工程
  • 498 篇 理学
    • 377 篇 数学
    • 100 篇 物理学
    • 77 篇 统计学(可授理学、...
    • 75 篇 生物学
    • 26 篇 化学
    • 23 篇 系统科学
  • 276 篇 管理学
    • 168 篇 图书情报与档案管...
    • 123 篇 管理科学与工程(可...
    • 88 篇 工商管理
  • 66 篇 教育学
    • 64 篇 教育学
  • 63 篇 医学
    • 61 篇 临床医学
    • 34 篇 基础医学(可授医学...
    • 24 篇 药学(可授医学、理...
  • 28 篇 法学
    • 23 篇 社会学
  • 18 篇 经济学
  • 9 篇 农学
  • 3 篇 军事学
  • 1 篇 文学
  • 1 篇 艺术学

主题

  • 91 篇 mobile computing
  • 72 篇 distributed comp...
  • 69 篇 computer science
  • 53 篇 grid computing
  • 47 篇 application soft...
  • 40 篇 concurrent compu...
  • 39 篇 computational mo...
  • 36 篇 computer network...
  • 34 篇 computer archite...
  • 32 篇 cloud computing
  • 29 篇 virtual reality
  • 29 篇 ubiquitous compu...
  • 27 篇 internet
  • 26 篇 costs
  • 25 篇 laboratories
  • 23 篇 peer to peer com...
  • 23 篇 middleware
  • 20 篇 parallel process...
  • 20 篇 processor schedu...
  • 20 篇 hardware

机构

  • 20 篇 the hong kong po...
  • 18 篇 hong kong polyte...
  • 18 篇 department of co...
  • 15 篇 school of comput...
  • 15 篇 school of comput...
  • 12 篇 institute of com...
  • 12 篇 department of co...
  • 10 篇 nit calicut
  • 10 篇 depauw universit...
  • 10 篇 national institu...
  • 9 篇 school of comput...
  • 8 篇 college of compu...
  • 7 篇 school of comput...
  • 7 篇 school of comput...
  • 6 篇 university of lo...
  • 6 篇 pablo de olavide...
  • 6 篇 department of co...
  • 6 篇 college of compu...
  • 6 篇 department of co...
  • 6 篇 school of comput...

作者

  • 25 篇 hong va leong
  • 18 篇 leong hong va
  • 15 篇 alvin chan
  • 12 篇 hong jiman
  • 11 篇 hung chih-cheng
  • 11 篇 chan alvin t.s.
  • 10 篇 liu ling
  • 10 篇 gloria childress...
  • 10 篇 george roussos
  • 8 篇 umesh bellur
  • 8 篇 song enmin
  • 7 篇 rajiv ramnath
  • 7 篇 pu calton
  • 7 篇 si antonio
  • 7 篇 ahamed sheikh iq...
  • 7 篇 chandran priya
  • 6 篇 federico divina
  • 6 篇 sheikh iqbal aha...
  • 6 篇 madhu kumar s.d.
  • 6 篇 raúl giráldez ro...

语言

  • 2,065 篇 英文
  • 9 篇 其他
  • 3 篇 中文
  • 2 篇 葡萄牙文
检索条件"任意字段=Applied Computing 2004 - Proceedings of the 2004 ACM Symposium on Applied Computing"
2079 条 记 录,以下是1981-1990 订阅
排序:
SNACC: A parser generator for use with Miranda  96
SNACC: A parser generator for use with Miranda
收藏 引用
1996 acm symposium on applied computing, SAC 1996
作者: Turner, D.A. Computing Laboratory University of Kent CanterburyCT2 7NF United Kingdom
Miranda is a lazy functional language with polymorphic typing and a simple but powerful module system, which is quite widely used for teaching and research in functional programming. SNACCY= "Surely NoiAnotherCom... 详细信息
来源: 评论
A comparison of local search algorithms for radio link frequency assignment problems  96
A comparison of local search algorithms for radio link frequ...
收藏 引用
1996 acm symposium on applied computing, SAC 1996
作者: Hurley, S. Thiel, S.U. Smith, D.H. Dept. of Computer Science University of Wales Cardiff P.O. Box 916 CardiffCF2 3XF United Kingdom Dept. of Maths. and Computing University of Glamorgan Pontypridd Mid GlamorganCF37 1DL United Kingdom
The frequency assignment problem, known to be NPcomplete, is to find an assignment of radio frequencies to a set of transmitters in a region. The interference level between the frequencies assigned to different commun... 详细信息
来源: 评论
The implementation of a chronicle collection class in Smalltalk/DB  96
The implementation of a chronicle collection class in Smallt...
收藏 引用
1996 acm symposium on applied computing, SAC 1996
作者: Schleifer, Paul Sun, Yuan Patel, Dilip School of Computing Information Systems and Mathematics South Bank University 103 Borough Road LondonSEI OAA United Kingdom
In this paper, we present the implementation of a compact temporal object model based on time sequences as a general purpose collection class, called the Chronic le, in the Smalltalk/DB language. This provides an obje... 详细信息
来源: 评论
A stroke-order free Chinese handwriting input system based on relative stroke positions and back-propagation networks  96
A stroke-order free Chinese handwriting input system based o...
收藏 引用
1996 acm symposium on applied computing, SAC 1996
作者: Leung, Wing-Nin Cheng, Kam-Shun Department of Computing Hong Kong Polytechnic University Hung Horn Kowloon Hong Kong
In this paper, we present a new Chinese handwriting input method using relative stroke positions and backpropagation networks. This method overcomes the problems of missing strokes, extra strokes and iinkiug strokes a... 详细信息
来源: 评论
Partial-order methods for model checking: From linear time to branching time
Partial-order methods for model checking: From linear time t...
收藏 引用
11th Annual IEEE symposium on Logic in Computer Science (LIVS 96)
作者: Bernard, W Pierre, W UNIV LIEGE INST MONTEFIOREB-4000 LIEGEBELGIUM
Partial-order methods make it possible to check properties of a concurrent system by state-space exploration without considering all interleavings of independent concurrent events. They have been applied to linear-tim... 详细信息
来源: 评论
A better approximation algorithm for finding planar subgraphs  7
A better approximation algorithm for finding planar subgraph...
收藏 引用
7th Annual acm-SIAM symposium on Discrete Algorithms, SODA 1996
作者: Cǎlinescu, Gruia Fernandes, Cristina G. Finkler, Ulrich Karloff, Howard College of Computing Georgia Institute of Technology AtlantaGA30332-0280 United States Max-Planck-Institut für Informatik SaarbrückenD-66123 Germany
The MAXIMUM PLANAR SUBGRAPH problem-given a graph G, find a largest planar subgraph of G-has applications in circuit layout, facility layout, and graph drawing. No previous polynomial-time approximation algorithm for ... 详细信息
来源: 评论
Heuristics for register-constrained software pipelining  29
Heuristics for register-constrained software pipelining
收藏 引用
IEEE/acm International symposium on Microarchitecture (MICRO)
作者: J. Llosa M. Valero E. Ayguade Departament dE28099Arquitectura de Computadors Universitat Poliltècnica de Catalunya Barcelona Spain
Software Pipelining is a loop scheduling technique that extracts parallelism from loops by overlapping the execution of several consecutive iterations. There has been a significant effort to produce throughput-optimal... 详细信息
来源: 评论
Speculative hedge: regulating compile-time speculation against profile variations
Speculative hedge: regulating compile-time speculation again...
收藏 引用
IEEE/acm International symposium on Microarchitecture (MICRO)
作者: B.L. Deitrich W.W. Hwu Center for Reliable and High-Performance Computing University of Illinois Urbana IL USA
Path-oriented scheduling methods, such os trace scheduling and hyperblock scheduling, use speculation to extract instruction-level parallelism from control-intensive programs. These methods predict important execution... 详细信息
来源: 评论
Modulo scheduling of loops in control-intensive non-numeric programs
Modulo scheduling of loops in control-intensive non-numeric ...
收藏 引用
IEEE/acm International symposium on Microarchitecture (MICRO)
作者: D.M. Lavery W.W. Hwu Center for Reliable and High-Performance Computing University of Illinois Urbana-Champaign IL USA
Much of the previous work on modulo scheduling has targeted numeric programs, in which, often, the majority of the loops are well-behaved loop-counter-based loops without early exits. In control-intensive non-numeric ... 详细信息
来源: 评论
Modulo scheduling of loops in control-intensive non-numeric programs  29
Modulo scheduling of loops in control-intensive non-numeric ...
收藏 引用
proceedings of the 29th annual acm/IEEE international symposium on Microarchitecture
作者: Daniel M. Lavery Wen-mei W. Hwu Center for Reliable and High-Performance Computing University of Illinois Urbana-Champaign IL
Much of the previous work on modulo scheduling has targeted numeric programs, in which, often, the majority of the loops are well-behaved loop-counter-based loops without early exits. In control-intensive non-numeric ... 详细信息
来源: 评论