咨询与建议

限定检索结果

文献类型

  • 518 篇 会议
  • 298 篇 期刊文献
  • 9 册 图书

馆藏范围

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

日期分布

学科分类号

  • 424 篇 工学
    • 319 篇 计算机科学与技术...
    • 248 篇 软件工程
    • 77 篇 信息与通信工程
    • 58 篇 控制科学与工程
    • 30 篇 生物工程
    • 27 篇 电气工程
    • 26 篇 化学工程与技术
    • 24 篇 机械工程
    • 19 篇 动力工程及工程热...
    • 19 篇 电子科学与技术(可...
    • 17 篇 生物医学工程(可授...
    • 15 篇 力学(可授工学、理...
    • 15 篇 光学工程
    • 15 篇 仪器科学与技术
    • 15 篇 材料科学与工程(可...
    • 7 篇 航空宇航科学与技...
  • 370 篇 理学
    • 302 篇 数学
    • 92 篇 统计学(可授理学、...
    • 61 篇 物理学
    • 39 篇 生物学
    • 28 篇 系统科学
    • 27 篇 化学
  • 80 篇 管理学
    • 42 篇 管理科学与工程(可...
    • 38 篇 图书情报与档案管...
    • 28 篇 工商管理
  • 13 篇 教育学
    • 13 篇 教育学
  • 12 篇 经济学
    • 12 篇 应用经济学
  • 12 篇 医学
    • 10 篇 临床医学
    • 8 篇 基础医学(可授医学...
  • 7 篇 法学
    • 6 篇 社会学
  • 5 篇 农学
  • 1 篇 哲学
  • 1 篇 文学
  • 1 篇 历史学
  • 1 篇 军事学
  • 1 篇 艺术学

主题

  • 118 篇 computer science
  • 40 篇 mathematics
  • 19 篇 algorithm design...
  • 19 篇 polynomials
  • 17 篇 artificial intel...
  • 16 篇 educational inst...
  • 16 篇 computational mo...
  • 14 篇 humans
  • 14 篇 shape
  • 13 篇 data mining
  • 13 篇 equations
  • 12 篇 application soft...
  • 11 篇 routing
  • 11 篇 mathematical mod...
  • 11 篇 layout
  • 10 篇 concurrent compu...
  • 10 篇 control systems
  • 10 篇 topology
  • 10 篇 robustness
  • 9 篇 cameras

机构

  • 21 篇 department of co...
  • 11 篇 math. division n...
  • 11 篇 department of ma...
  • 9 篇 college of mathe...
  • 8 篇 courant inst. of...
  • 7 篇 department of ap...
  • 7 篇 inst. math. stoc...
  • 6 篇 department of co...
  • 6 篇 department of co...
  • 6 篇 machine learning...
  • 6 篇 department of ap...
  • 5 篇 department of ap...
  • 5 篇 school of comput...
  • 5 篇 research centre ...
  • 5 篇 department of ap...
  • 5 篇 dept. of math. a...
  • 4 篇 department of ma...
  • 4 篇 math. research i...
  • 4 篇 department of co...
  • 4 篇 department of ma...

作者

  • 11 篇 naor moni
  • 11 篇 ban jung-chao
  • 9 篇 hu wen-guei
  • 9 篇 sharir micha
  • 8 篇 alsmeyer gerold
  • 8 篇 m. irani
  • 8 篇 lai guan-yu
  • 7 篇 r. basri
  • 6 篇 hemaspaandra edi...
  • 6 篇 krishnaswamy smi...
  • 6 篇 srivastava gauta...
  • 6 篇 fitzsimmons zack
  • 6 篇 wu yu-liang
  • 5 篇 chang chih-hung
  • 5 篇 maldonado josé c...
  • 5 篇 irit dinur
  • 5 篇 macdonell stephe...
  • 5 篇 mendes emília
  • 5 篇 pinchasi rom
  • 5 篇 evangelos a. the...

语言

  • 806 篇 英文
  • 17 篇 其他
  • 2 篇 中文
检索条件"机构=Department of Applied Math. and Computer Science"
825 条 记 录,以下是81-90 订阅
排序:
Inducing approximately optimal flow using truthful mediators  15
Inducing approximately optimal flow using truthful mediators
收藏 引用
16th ACM Conference on Economics and Computation, EC 2015
作者: Rogers, Ryan Roth, Aaron Ullman, Jonathan Wu, Zhiwei Steven Applied Math and Computational Science Department University of Pennsylvania United States Department of Computer Science Columbia University United States
We revisit a classic coordination problem from the perspective of mechanism design: how can we coordinate a social welfare maximizing flow in a network congestion game with selfish players? The classical approach, whi... 详细信息
来源: 评论
Analytical modelling of a refined FCFS queueing discipline in multiprogrammed parallel processing systems
收藏 引用
International Journal of Modelling and Simulation 2000年 第3期20卷 248-254页
作者: Li, Keqin Dept. of Math. and Computer Science State University of New York New Paltz NY 12561-2499 United States Tsinghua University China University of Houston Department of Computer Science State University of New York New Paltz NY United States IEEE IEEE Computer Society ACM SIGACT
A multiprogrammed (or partitionable) parallel computer system can be partitioned into subsystems which are allocated to independent jobs. The performance of such a parallel processing system is determined by the syste... 详细信息
来源: 评论
Building a Good Team: Secretary Problems and the Supermodular Degree  17
Building a Good Team: Secretary Problems and the Supermodula...
收藏 引用
Annual ACM-Society for Industrial and applied math.atics Symposium on Discrete Algorithms
作者: Moran Feldman Rani Izsak Department of Mathematics and Computer Science The Open University of Israel Department of Computer Science and Applied Math. Weizmann Institute of Science
In the (classical) SECRETARY PROBLEM, one has to hire the best among n candidates. The candidates are interviewed, one at a time, at a uniformly random order, and one has to decide on the spot, whether to hire a candi... 详细信息
来源: 评论
A COMPETITIVE AND PREY-PREDATOR MODEL WITH STAGE-STRUCTURE
收藏 引用
Annals of Differential Equations 2004年 第1期20卷 49-58页
作者: 罗桂烈 刘丙辰 李锋杰 Math. and Computer Science College Guangzi Normal University Guilin 541004 Dept. of Applied Math. Dalian University of Technology Dalian 116024
The uniform persistence is proved for a non-autonomous competitive and prey-predator model with ratio-dependent functional response and stage-structure. By constructing a Liapunov functional, we establish the conditio... 详细信息
来源: 评论
The effectiveness of Lloyd-type methods for the k-means problem
The effectiveness of Lloyd-type methods for the k-means prob...
收藏 引用
47th Annual IEEE Symposium on Foundations of computer science, FOCS 2006
作者: Ostrovsky, Rafail Rabani, Yuval Schulman, Leonard J. Swamy, Chaitanya Computer Science Department UCLA Computer Science Department Technion - Israel Institute of Technology Haifa 32000 Israel Caltech Pasadena CA 91125 Center for the Math. of Information Caltech Pasadena CA 91125
We investigate variants of Lloyd's heuristic for clustering high dimensional data in an attempt to explain its popularity (a half century after its introduction) among practitioners, and in order to suggest improv... 详细信息
来源: 评论
Warping Indexes with Envelope Transforms for Query by Humming  03
Warping Indexes with Envelope Transforms for Query by Hummin...
收藏 引用
2003 ACM SIGMOD International Conference on Management of Data
作者: Zhu, Yunyue Shasha, Dennis Department of Computer Science Courant Inst. of Math. Sciences New York University New York NY 10012 United States
A Query by Humming system allows the user to find a song by humming part of the tune. No musical training is needed. Previous query by humming systems have not provided satisfactory results for various reasons. Some s...
来源: 评论
Improving TCP performance over mobile ad hoc networks by exploiting cross-layer information awareness  04
Improving TCP performance over mobile ad hoc networks by exp...
收藏 引用
MobiCom 2004 - Proceedings of the Tenth Annual International Conference on Mobile Computing and Networking
作者: Yu, Xin Department of Computer Science Courant Inst. of Math. Sciences New York University New York NY 10012 United States
TCP performance degrades significantly in mobile ad hoc networks because most of packet losses occur as a result of route failures. Prior work proposed to provide link failure feedback to TCP so that TCP can avoid res... 详细信息
来源: 评论
Editorial
收藏 引用
Fuzzy Sets and Systems 2015年 281卷 1-3页
作者: De Baets, Bernard Dubois, Didier Hüllermeier, Eyke KERMIT Dept. of Math. Modeling Statistics and Bioinformatics Ghent University Belgium IRIT CNRS Université de Toulouse France Intelligent Systems Group Department of Computer Science University of Paderborn Germany
来源: 评论
Parallel processing over mobile ad hoc networks of handheld machines  01
Parallel processing over mobile ad hoc networks of handheld ...
收藏 引用
Proceedings of the 2001 ACM International Symposium on Mobile Ad Hoc Networking and Computing: MobiHoc 2001
作者: Jipping, Michael J. Lewandowski, Gary Department of Computer Science Hope College Holland MI 49423 United States Dept. of Math. and Computer Science Xavier University Cincinnati OH 45207-4441 United States
A parallel computation model that takes advantage of a networking infrastructure that enables server-free resource sharing based on the Jini approach is described. The network is a connected network of nodes that dire... 详细信息
来源: 评论
The K-armed dueling bandits problem
The K-armed dueling bandits problem
收藏 引用
22nd Conference on Learning Theory, COLT 2009
作者: Yue, Yisong Broder, Josef Kleinberg, Robert Joachims, Thorsten Dept. of Computer Science Cornell University Ithaca NY 14853 United States Center for Applied Math. Cornell University Ithaca NY 14853 United States
We study a partial-information online-learning problem where actions are restricted to noisy comparisons between pairs of strategies (also known as bandits). In contrast to conventional approaches that require the abs...
来源: 评论