咨询与建议

限定检索结果

文献类型

  • 9 篇 期刊文献
  • 4 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 11 篇 工学
    • 7 篇 计算机科学与技术...
    • 2 篇 力学(可授工学、理...
    • 2 篇 机械工程
    • 2 篇 控制科学与工程
    • 2 篇 软件工程
    • 1 篇 电气工程
    • 1 篇 电子科学与技术(可...
    • 1 篇 信息与通信工程
    • 1 篇 建筑学
    • 1 篇 土木工程
    • 1 篇 交通运输工程
    • 1 篇 船舶与海洋工程
  • 5 篇 理学
    • 2 篇 数学
    • 2 篇 物理学
    • 1 篇 系统科学
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...

主题

  • 13 篇 combinatorial op...
  • 2 篇 quantum algorith...
  • 2 篇 variational quan...
  • 2 篇 searching algori...
  • 2 篇 optimization alg...
  • 1 篇 consumers
  • 1 篇 multimodal learn...
  • 1 篇 numerical exampl...
  • 1 篇 scheduling and l...
  • 1 篇 approximate
  • 1 篇 bipartite chain ...
  • 1 篇 weakly decomposi...
  • 1 篇 constructivity
  • 1 篇 bin packing prob...
  • 1 篇 heterogeneous sy...
  • 1 篇 pressure vessels
  • 1 篇 algorithms
  • 1 篇 baseline
  • 1 篇 standard perform...
  • 1 篇 permutation

机构

  • 1 篇 indian inst sci ...
  • 1 篇 univ florence di...
  • 1 篇 struct engn res ...
  • 1 篇 agere syst signa...
  • 1 篇 poznan supercomp...
  • 1 篇 so illinois univ...
  • 1 篇 univ sheffield d...
  • 1 篇 petru maior univ...
  • 1 篇 columbia univ de...
  • 1 篇 nanyang technolo...
  • 1 篇 poznan univ tech...
  • 1 篇 national univers...
  • 1 篇 texas state univ...
  • 1 篇 laboratoire roi ...
  • 1 篇 univ. of michiga...
  • 1 篇 research group i...
  • 1 篇 yahoo research
  • 1 篇 univ ramon llull...
  • 1 篇 indian inst sci ...
  • 1 篇 laboratoire roi ...

作者

  • 1 篇 atchade adelomou...
  • 1 篇 iantovics barna
  • 1 篇 drozdowski m.
  • 1 篇 mohanty atanu k.
  • 1 篇 lawehda m.
  • 1 篇 silvestri r
  • 1 篇 king charles r.
  • 1 篇 levin m. sh.
  • 1 篇 rao a. rama moha...
  • 1 篇 nechita elena
  • 1 篇 satyen kale
  • 1 篇 elisabet golobar...
  • 1 篇 lamia trabelsi
  • 1 篇 atchade parfait ...
  • 1 篇 trevisan l
  • 1 篇 golobardes ribe ...
  • 1 篇 chakraborty kana...
  • 1 篇 chatterjee anind...
  • 1 篇 jie zhang
  • 1 篇 crescenzi p

语言

  • 13 篇 英文
检索条件"主题词=Combinatorial optimization algorithms"
13 条 记 录,以下是1-10 订阅
排序:
Improving combinatorial optimization algorithms through Record Keeping in Constructive Multistart Search
收藏 引用
INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS 2014年 第9期29卷 864-879页
作者: King, Charles R. Tamir, Dan E. McKenney, Mark Texas State Univ Dept Comp Sci San Marcos TX 78666 USA So Illinois Univ Dept Comp Sci Edwardsville IL 62026 USA
Constructive multistart search algorithms are commonly used to address combinatorial optimization problems;however, constructive multistart search algorithm performance is fundamentally affected by two factors: (i) Th... 详细信息
来源: 评论
RECOGNITION AND combinatorial optimization algorithms FOR BIPARTITE CHAIN GRAPHS
收藏 引用
COMPUTING AND INFORMATICS 2013年 第2期32卷 313-329页
作者: Talmaciu, Mihai Nechita, Elena Iantovics, Barna Vasile Alecsandri Univ Bacau Dept Math & Informat Bacau Romania Petru Maior Univ Targu Mures Dept Informat Targu Mures Romania
In this paper we give a recognition algorithm in O(n(n + m)) time for bipartite chain graphs, and directly calculate the density of such graphs. For their stability number and domination number, we give algorithms com... 详细信息
来源: 评论
Using the Variational-Quantum-Eigensolver (VQE) to Create an Intelligent Social Workers Schedule Problem Solver  15th
Using the Variational-Quantum-Eigensolver (VQE) to Create an...
收藏 引用
15th International Conference on Hybrid Artificial Intelligence Systems (HAIS)
作者: Atchade Adelomou, Parfait Golobardes Ribe, Elisabet Vilasis Cardona, Xavier Univ Ramon Llull Res Grp Data Sci Digital Soc DS4DS La Salle St Joan Salle 42 Barcelona 08022 Spain
The scheduling problem of social workers is a class of combinatorial optimization problems that can be solved in exponential time at best. Because is belongs to class of problems known as NP-Hard, which have huge impa... 详细信息
来源: 评论
Solving 3D Bin Packing Problem via Multimodal Deep Reinforcement Learning  21
Solving 3D Bin Packing Problem via Multimodal Deep Reinforce...
收藏 引用
International Conference on Autonomous Agents and Multiagent Systems
作者: Yuan Jiang Zhiguang Cao Jie Zhang Nanyang Technological University National University of Singapore
Recently, there is growing attention on applying deep reinforcement learning (DRL) to solve the 3D bin packing problem (3D BPP), given its favorable generalization and independence of ground-truth label. However, due ... 详细信息
来源: 评论
Formulation of the Social Workers’ Problem in Quadratic Unconstrained Binary optimization Form and Solve It on a Quantum Computer
收藏 引用
Journal of Computer and Communications 2020年 第11期8卷 44-68页
作者: Atchade Parfait Adelomou Elisabet Golobardes Ribé Xavier Vilasis Cardona Research Group in Data Science for the Digital Society (DS4DS) Barcelona Spain
The problem of social workers visiting their patients at home is a class of combinatorial optimization problems and belongs to the class of problems known as NP-Hard. These problems require heuristic techniques to pro... 详细信息
来源: 评论
Hardness of Online Sleeping combinatorial optimization Problems  16
Hardness of Online Sleeping Combinatorial Optimization Probl...
收藏 引用
Annual Conference on Neural Information Processing Systems
作者: Satyen Kale Chansoo Leet David Pal Yahoo Research Univ. of Michigan Ann Arbor
We show that several online combinatorial optimization problems that admit efficient no-regret algorithms become computationally hard in the sleeping setting where a subset of actions becomes unavailable in each round... 详细信息
来源: 评论
A new web-based solver for combinatorial optimization Problems under Permutation Property
A new web-based solver for Combinatorial Optimization Proble...
收藏 引用
International Conference on Modeling, Simulation and Applied optimization
作者: Lamia Trabelsi Talel Ladhari Laboratoire ROI Ecole Polytechnique Laboratoire ROI Ecole Polytechnique BEM-Bordeaux Management School
combinatorial optimization problems under permutation property (COPP) are generally NP-hard. To address such problems, metaheuristic approaches have increasingly captured the research interest due to their abilities t... 详细信息
来源: 评论
Connection of Users with a Telecommunications Network: Multicriteria Assignment Problem
收藏 引用
JOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS 2010年 第12期55卷 1532-1541页
作者: Levin, M. Sh. Petukhov, M. V.
The problem of connection of users with access points of a wireless telecommunications network is analyzed. An approach is based on the multicriteria assignment problem. A set of criteria involves the maximum bandwidt... 详细信息
来源: 评论
A Meta-Heuristic Algorithm for Multi-Objective Optimal Design of Hybrid Laminate Composite Structures
收藏 引用
COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING 2010年 第3期25卷 149-170页
作者: Rao, A. Rama Mohan Shyju, P. P. Struct Engn Res Ctr Madras 600113 Tamil Nadu India
In this article, we propose a meta-heuristic algorithm for solving multi-objective combinatorial optimization problems. The proposed multi-objective combinatorial optimization algorithm is developed by combining the g... 详细信息
来源: 评论
A combinatorial optimization problem for high order PODs with few sensors
收藏 引用
JOURNAL OF VIBRATION AND ACOUSTICS-TRANSACTIONS OF THE ASME 2007年 第2期129卷 252-255页
作者: Mohanty, Atanu K. Chakraborty, Kanad Chatterjee, Anindya Indian Inst Sci Supercomp Educ & Res Ctr Bangalore 560012 Karnataka India Agere Syst Signal Integr & Interconnect Anal Grp Allentown PA 18109 USA Indian Inst Sci Dept Mech Engn Bangalore 560012 Karnataka India
Experimental characterization of high dimensional dynamic systems sometimes uses the proper orthogonal decomposition (POD). If there are many measurement locations and relatively fewer sensors, then steady-state behav... 详细信息
来源: 评论