咨询与建议

限定检索结果

文献类型

  • 312 篇 期刊文献
  • 237 篇 会议
  • 13 篇 学位论文
  • 1 篇 资讯

馆藏范围

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

日期分布

学科分类号

  • 488 篇 工学
    • 322 篇 计算机科学与技术...
    • 162 篇 电气工程
    • 86 篇 信息与通信工程
    • 60 篇 控制科学与工程
    • 58 篇 软件工程
    • 24 篇 机械工程
    • 24 篇 仪器科学与技术
    • 15 篇 电子科学与技术(可...
    • 14 篇 航空宇航科学与技...
    • 13 篇 石油与天然气工程
    • 11 篇 材料科学与工程(可...
    • 8 篇 动力工程及工程热...
    • 7 篇 网络空间安全
    • 6 篇 力学(可授工学、理...
    • 5 篇 土木工程
    • 5 篇 测绘科学与技术
  • 107 篇 理学
    • 59 篇 数学
    • 17 篇 系统科学
    • 14 篇 物理学
    • 12 篇 化学
    • 9 篇 生物学
    • 9 篇 统计学(可授理学、...
    • 5 篇 地球物理学
  • 63 篇 管理学
    • 54 篇 管理科学与工程(可...
    • 9 篇 图书情报与档案管...
  • 14 篇 医学
    • 9 篇 临床医学
  • 13 篇 教育学
    • 9 篇 教育学
    • 6 篇 心理学(可授教育学...
  • 9 篇 经济学
    • 7 篇 应用经济学
  • 7 篇 法学
    • 6 篇 法学
  • 3 篇 农学
  • 2 篇 军事学
  • 2 篇 艺术学
  • 1 篇 哲学
  • 1 篇 文学

主题

  • 563 篇 algorithm design
  • 24 篇 optimization
  • 23 篇 algorithms
  • 15 篇 machine learning
  • 10 篇 algorithm design...
  • 9 篇 simulation
  • 9 篇 artificial intel...
  • 8 篇 approximation al...
  • 8 篇 data mining
  • 8 篇 cloud computing
  • 7 篇 metaheuristics
  • 7 篇 computational ge...
  • 7 篇 mobile edge comp...
  • 7 篇 evolutionary alg...
  • 7 篇 particle swarm o...
  • 7 篇 resource allocat...
  • 6 篇 genetic algorith...
  • 6 篇 algorithm comple...
  • 6 篇 social networks
  • 6 篇 energy consumpti...

机构

  • 7 篇 southeast univ s...
  • 4 篇 boston univ bost...
  • 3 篇 ohio state univ ...
  • 3 篇 univ chinese aca...
  • 3 篇 nanjing univ sta...
  • 3 篇 northeast petr u...
  • 3 篇 ben gurion univ ...
  • 3 篇 univ maryland de...
  • 3 篇 queen mary univ ...
  • 3 篇 city univ hong k...
  • 3 篇 univ calif santa...
  • 3 篇 hainan normal un...
  • 3 篇 isi fdn turin
  • 2 篇 univ houston dep...
  • 2 篇 univ arizona dep...
  • 2 篇 computer science...
  • 2 篇 yunnan coll busi...
  • 2 篇 inra ur math & i...
  • 2 篇 chongqing univ c...
  • 2 篇 univ alicante de...

作者

  • 5 篇 wu weiwei
  • 5 篇 liu xi
  • 4 篇 prieto javier
  • 4 篇 shan feng
  • 4 篇 casado-vara robe...
  • 4 篇 liu jun
  • 4 篇 shen chih-ya
  • 4 篇 nong ge
  • 4 篇 xie lei
  • 4 篇 day whe
  • 4 篇 tian wenda
  • 3 篇 corchado juan m.
  • 3 篇 chen jingsen
  • 3 篇 bein wolfgang
  • 3 篇 xue jinyun
  • 3 篇 fournier herve
  • 3 篇 yu chang wu
  • 3 篇 liang weifa
  • 3 篇 lu sanglu
  • 3 篇 arasli batuhan

语言

  • 530 篇 英文
  • 27 篇 其他
  • 5 篇 中文
  • 2 篇 德文
  • 1 篇 法文
  • 1 篇 意大利文
检索条件"主题词=Algorithm Design"
563 条 记 录,以下是311-320 订阅
排序:
Revealing connectivity in residential Architecture: An algorithmic approach to extracting adjacency matrices from floor plans
收藏 引用
Frontiers of Architectural Research 2024年 第2期13卷 370-386页
作者: Mohammad Amin Moradi Omid Mohammadrashidi Navid Niazkar Morteza Rahbar School of Architecture and Engineering University College of RouzbahanMazandaranIran School of Architecture Islamic Azad UniversitySafaDasht CampusTehranIran A.James Clark School of Engineering University of MarylandCollege ParkMDUSA School of Architecture and Environmental Design Iran University of Science and TechnologyTehranIran
In today's world, various approaches and parameters exist for designing a plan and determining its spatial, placement. Hence, various modes for identifying crucial locations can be explored when an architectural p... 详细信息
来源: 评论
A randomized algorithm for two servers in cross polytope spaces
收藏 引用
THEORETICAL COMPUTER SCIENCE 2011年 第7期412卷 563-572页
作者: Bein, Wolfgang Iwama, Kazuo Kawahara, Jun Larmore, Lawrence L. Oravec, James A. Univ Nevada Sch Comp Sci Ctr Adv Study Algorithms Las Vegas NV 89154 USA Kyoto Univ Sch Informat Kyoto 6068501 Japan
It has been a long-standing open problem to determine the exact randomized competitiveness of the 2-server problem, that is, the minimum competitiveness of any randomized online algorithm for the 2-server problem. For... 详细信息
来源: 评论
Efficient algorithms for k maximum sums
收藏 引用
algorithmICA 2006年 第1期46卷 27-41页
作者: Bengtsson, Fredrik Chen, Jingsen Lulea Univ Technol Dept Comp Sci & Elect Engn S-97187 Lulea Sweden
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers (x(1), x(2),..., x(n)) and an integer parameter k, 1 <= k <= 1/2n(n - 1), the problem involves finding the k lar... 详细信息
来源: 评论
A scenario-based metaheuristic and optimization framework for cost-effective machine-trail network design in forestry
收藏 引用
COMPUTERS AND ELECTRONICS IN AGRICULTURE 2023年 第1期212卷
作者: Hosseini, Ahmad Wadbro, Eddie Do, Dung Ngoc Lindroos, Ola Umea Univ Dept Comp Sci Umea Sweden Univ Nova Gor Sch Engn & Management Nova Gorica Slovenia Karlstad Univ Dept Math & Comp Sci Karlstad Sweden Swedish Univ Agr Sci Dept Forest Biomat & Technol Umea Sweden
designing an optimal machine trail network is a complex locational problem that requires an understanding of different machines' operations and terrain features as well as the trade-offs between various objectives... 详细信息
来源: 评论
Usability Evaluation of an Online Inquiry-based Learning Platform for Computational Thinking (CT-ONLINQ)  23
Usability Evaluation of an Online Inquiry-based Learning Pla...
收藏 引用
23rd IEEE International Conference on Advanced Learning Technologies (ICALT)
作者: Jha, Nitesh Kumar Bhowmik, Plaban Kumar Bhagat, Kaushal Kumar Indian Inst Technol Kharagpur Adv Technol Dev Ctr Kharagpur West Bengal India Indian Inst Technol Kharagpur GS Sanyal Sch Telecommun Kharagpur West Bengal India
With the increased focus on Computational Thinking (CT) in education, there has been an increase in the development of learning platforms to teach CT. The current study developed an Online Inquiry-based learning platf... 详细信息
来源: 评论
GENERAL SYSTEMS-THEORY AND algorithm THEORY
收藏 引用
INTERNATIONAL JOURNAL OF GENERAL SYSTEMS 1983年 第3期9卷 157-160页
作者: JONES, B Computer Science Department Louisiana State University Baton Rouge Louisiana United States
This paper briefly considers tome relationships of general systems theory to algorithm theory. A general systems theory type of approach provides a framework for algorithm design. We explicate this framework, and then... 详细信息
来源: 评论
Water wave optimization for combinatorial optimization: design strategies and applications
收藏 引用
APPLIED SOFT COMPUTING 2019年 83卷 105611-000页
作者: Zheng, Yu-Jun Lu, Xue-Qin Du, Yi-Chen Xue, Yu Sheng, Wei-Guo Hangzhou Normal Univ Inst Serv Engn Hangzhou 311121 Zhejiang Peoples R China Zhejiang Univ Technol Coll Comp Sci & Technol Hangzhou 310023 Zhejiang Peoples R China Nanjing Univ Informat Sci & Technol Sch Comp & Software Nanjing 210044 Jiangsu Peoples R China Victoria Univ Wellington Sch Engn & Comp Sci Wellington 6140 New Zealand
Although the community of nature-inspired computing has witnessed a wide variety of metaheuristics, it often requires considerable effort to adapt them to different combinatorial optimization problems (COPs), and few ... 详细信息
来源: 评论
AN ASYMPTOTICALLY OPTIMAL algorithm FOR THE DUTCH NATIONAL FLAG PROBLEM
收藏 引用
SIAM JOURNAL ON COMPUTING 1982年 第2期11卷 243-262页
作者: BITNER, JR
We develop an algorithm for the Dutch National Flag problem that has an adjustable integer parameter smax≧0smax≧0\operatorname{smax} \geqq 0 allowing a time/space tradeoff. (Let n be the length of the input to be or... 详细信息
来源: 评论
Fitting a Step Function to a Point Set
收藏 引用
algorithmICA 2011年 第1期60卷 95-109页
作者: Fournier, Herve Vigneron, Antoine INRA UR Math & Informat Appl 341 F-78350 Jouy En Josas France Univ Versailles St Quentin en Yvelines CNRS UMR 8144 Lab PRiSM F-78035 Versailles France
We consider the problem of fitting a step function to a set of points. More precisely, given an integer k and a set P of n points in the plane, our goal is to find a step function f with k steps that minimizes the max... 详细信息
来源: 评论
On manipulability of algorithms
On manipulability of algorithms
收藏 引用
2nd International Conference on Information Warfare and Security
作者: Braynov, Sviatoslav Univ Illinois Springfield IL USA
In adversarial situations, the input data to an algorithm could be manipulated to make the algorithm produce erroneous output or to make a wrong decision. The paper presents a formal definition and a model of algorith... 详细信息
来源: 评论