咨询与建议

限定检索结果

文献类型

  • 358 篇 会议
  • 2 篇 期刊文献

馆藏范围

  • 360 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 238 篇 工学
    • 235 篇 计算机科学与技术...
    • 76 篇 软件工程
    • 16 篇 电子科学与技术(可...
    • 11 篇 电气工程
    • 7 篇 信息与通信工程
    • 7 篇 控制科学与工程
    • 4 篇 机械工程
    • 4 篇 动力工程及工程热...
    • 2 篇 力学(可授工学、理...
    • 2 篇 光学工程
    • 2 篇 仪器科学与技术
    • 2 篇 建筑学
    • 2 篇 化学工程与技术
    • 1 篇 材料科学与工程(可...
    • 1 篇 土木工程
    • 1 篇 农业工程
    • 1 篇 环境科学与工程(可...
    • 1 篇 生物工程
  • 160 篇 理学
    • 155 篇 数学
    • 11 篇 统计学(可授理学、...
    • 4 篇 物理学
    • 1 篇 化学
    • 1 篇 生物学
  • 11 篇 管理学
    • 8 篇 管理科学与工程(可...
    • 8 篇 工商管理
    • 2 篇 图书情报与档案管...
  • 3 篇 教育学
    • 3 篇 教育学
  • 2 篇 经济学
    • 2 篇 应用经济学
  • 2 篇 法学
    • 2 篇 社会学
  • 1 篇 农学
    • 1 篇 作物学

主题

  • 83 篇 computer science
  • 32 篇 formal logic
  • 19 篇 logic
  • 19 篇 computational mo...
  • 19 篇 polynomials
  • 16 篇 registers
  • 16 篇 semantics
  • 15 篇 mathematics
  • 13 篇 probabilistic lo...
  • 13 篇 standards
  • 13 篇 delay
  • 12 篇 computer archite...
  • 12 篇 hardware
  • 11 篇 concurrent compu...
  • 11 篇 first-order logi...
  • 11 篇 contracts
  • 11 篇 complexity theor...
  • 10 篇 automata
  • 9 篇 linear logic
  • 9 篇 application soft...

机构

  • 8 篇 univ oxford oxfo...
  • 8 篇 cnrs
  • 6 篇 rhein westfal th...
  • 5 篇 univ warsaw wars...
  • 5 篇 department of co...
  • 4 篇 univ bologna bol...
  • 4 篇 tech univ dresde...
  • 3 篇 inria le chesnay
  • 3 篇 department of co...
  • 3 篇 department of ap...
  • 3 篇 univ tokyo
  • 3 篇 carnegie mellon ...
  • 3 篇 mit laboratory f...
  • 2 篇 department of co...
  • 2 篇 vienna tech univ...
  • 2 篇 international co...
  • 2 篇 univ warsaw inst...
  • 2 篇 shanghai jiao to...
  • 2 篇 univ pisa pisa
  • 2 篇 nyu ny 10003 usa

作者

  • 4 篇 b. awerbuch
  • 4 篇 dal lago ugo
  • 3 篇 vardi moshe y.
  • 3 篇 d.m. tullsen
  • 3 篇 d. peleg
  • 3 篇 bojanczyk mikola...
  • 3 篇 gastin paul
  • 3 篇 kiefer sandra
  • 3 篇 worrell james
  • 3 篇 schweitzer pasca...
  • 2 篇 s. dwarkadas
  • 2 篇 adsul bharat
  • 2 篇 kanovich max i.
  • 2 篇 t. leighton
  • 2 篇 kolaitis phokion...
  • 2 篇 avanzini martin
  • 2 篇 krishna shankara...
  • 2 篇 d.h. albonesi
  • 2 篇 tsukada takeshi
  • 2 篇 skrzypczak micha...

语言

  • 358 篇 英文
  • 2 篇 其他
检索条件"任意字段=Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science"
360 条 记 录,以下是181-190 订阅
排序:
Work in progress - Employing a learning model on a traditional engineering course
Work in progress - Employing a learning model on a tradition...
收藏 引用
34th annual Frontiers in Education: Expanding Educational Opportunities through Partnerships and Distance Learning - Conference proceedings, FIE
作者: Brown, Cordelia M. Brodersen, Arthur J. Vanderbilt University Electrical Engineering and Computer Science Nashville TN 37235
this paper explores the development of a general learning model that uses as a test bed a course on the introduction to digital logic. the learning model is based on techniques validated by researchers Richard Felder,... 详细信息
来源: 评论
A systolic parallel multiplier over GF(3m) using neuron-MOS DLC
A systolic parallel multiplier over GF(3m) using neuron-MOS ...
收藏 引用
proceedings - 34th International symposium on Multiple-Values logic, ISMVL 2004
作者: Yoon, Byoung Hee Han, Sung Il Choi, Young-Hee Hwang, Jong-Hak Seong, Hyeon-Kyeong Kim, Heung Soo Department of Electronic Engineering Inha University Incheon 402-751 Korea Republic of Dept. of Sports Engineering Korea Sport Science Institute 223-19 Seoul Korea Republic of Sch. of Comp./Info. Engineering Sangji Univ.
In this paper, a parallel Input/Output modulo multiplier, which is applied to AOTP(All One or Two Polynomials) multiplicative algorithm over GF(3 m), has been proposed using neuron-MOS Down-literal circuit on voltage ... 详细信息
来源: 评论
Panel - HP-funded engineering retention initiative: Methodologies and findings of four diverse universities/colleges
Panel - HP-funded engineering retention initiative: Methodol...
收藏 引用
34th annual Frontiers in Education: Expanding Educational Opportunities through Partnerships and Distance Learning - Conference proceedings, FIE
作者: Brooks, Sandy Brown, Susan W. Mack, Pamela Moya, John Oakes, William HP Philanthropy and Education College of Education New Mexico State University United States College of Engineering Morgan State University United States Department of Electrical and Computer Engineering University of Texas El Paso United States Department of Freshman Engineering Purdue University United States
Hewlett Packard (HP) Philanthropy and ' Education has a long and distinguished history of providing resources to improve education. Most recently, HP created an initiative that invites universities to transform en... 详细信息
来源: 评论
Control flow optimization via dynamic reconvergence prediction  37
Control flow optimization via dynamic reconvergence predicti...
收藏 引用
37th International symposium on Microarchitecture - MICRO-37 2004
作者: Collins, Jamison D. Tullsen, Dean M. Wang, Hong Department of Computer Science and Engineering University of California San Diego San Diego CA 92093-0114 United States Microarchitecture Research Labs Intel Corporation Santa Clara CA 95052 United States
this paper presents a novel microarchitecture technique for accurately predicting control flow reconvergence dynamically. A reconvergence point is the earliest dynamic instruction in the program where we can expect pr... 详细信息
来源: 评论
Banked multiported register files for high-frequency superscalar microprocessors  03
Banked multiported register files for high-frequency supersc...
收藏 引用
30th annual International symposium on computer Architecture
作者: Tseng, Jessica H. Asanović, Krste MIT Laboratory for Computer Science 200 Technology Square Cambridge MA 02139 United States
Multiported register files are a critical component of high-performance superscalar microprocessors. Conventional multiported structures can consume significant power and die area. We examine the designs of banked mul... 详细信息
来源: 评论
Fast secure processor for inhibiting software piracy and tampering  36
Fast secure processor for inhibiting software piracy and tam...
收藏 引用
ieee/acm International symposium on Microarchitecture (MICRO)
作者: Jun Yang Youtao Zhang Lan Gao Computer Science and Engineering Department University of California Riverside CA USA Computer Science Department University of Texas Dallas Richardson TX USA
Due to the widespread software piracy and virus attacks, significant efforts have been made to improve security for computer systems. For stand-alone computers, a key observation is that other than the processor, any ... 详细信息
来源: 评论
Lower bounds on the bounded coefficient complexity of bilinear maps
Lower bounds on the bounded coefficient complexity of biline...
收藏 引用
43rd annual ieee symposium on Foundations of computer science
作者: Bürgisser, P Lotz, M Univ Gesamthsch Paderborn Dept Math & Comp Sci D-33095 Paderborn Germany
We prove lower bounds of order n log n for both the problem to multiply polynomials of degree n, and to divide polynomials with remainder in the model of bounded coefficient arithmetic circuits over the complex number... 详细信息
来源: 评论
Characterizing and predicting value degree of use  35
Characterizing and predicting value degree of use
收藏 引用
35th annual ieee/acm International symposium on Microarchitecture
作者: Butts, JA Sohi, GS Univ Wisconsin Dept Comp Sci Madison WI 53706 USA
A value's degree of use-the number of dynamic uses of that value-provides the most essential information needed to optimize its communication. We present simulation results demonstrating the properties of degree o... 详细信息
来源: 评论
Virtual attendance in real engineering lab  34
Virtual attendance in real engineering lab
收藏 引用
34th Southeastern symposium on System theory, SSST 2002
作者: Henry, Jim College of Engineering and Computer Science University of Tennessee at Chattanooga ChattanoogaTN37403 United States
Engineering laboratory equipment at UTC has been made available for users via the World Wide Web. Users can conduct systems lab experiments from remote sites, anytime day-or-night, any day of the week. this paper desc... 详细信息
来源: 评论
Lower bounds on the bounded coefficient complexity of bilinear maps
Lower bounds on the bounded coefficient complexity of biline...
收藏 引用
annual ieee symposium on Foundations of computer science
作者: P. Burgisser M. Lotz Department of Mathematics and Computer Science University of Paderborn Paderborn Germany
We prove lower bounds of order n log n for both the problem to multiply polynomials of degree n, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbe... 详细信息
来源: 评论