检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

492 篇 会议
11 册 图书
8 篇 期刊文献

馆藏范围

510 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

408 篇 工学
- 370 篇 计算机科学与技术...
- 101 篇 软件工程
- 42 篇 电气工程
- 25 篇 信息与通信工程
- 15 篇 控制科学与工程
- 13 篇 机械工程
- 12 篇 生物工程
- 9 篇 电子科学与技术（可...
- 7 篇 冶金工程
- 6 篇 力学（可授工学、理...
- 5 篇 建筑学
- 5 篇 生物医学工程（可授...
- 3 篇 材料科学与工程（可...
- 3 篇 动力工程及工程热...
- 3 篇 化学工程与技术
- 3 篇 交通运输工程
- 3 篇 环境科学与工程（可...
159 篇 理学
- 131 篇 数学
- 23 篇 生物学
- 21 篇 系统科学
- 18 篇 统计学（可授理学、...
- 15 篇 物理学
- 4 篇 化学
40 篇 管理学
- 35 篇 管理科学与工程(可...
- 22 篇 工商管理
- 7 篇 图书情报与档案管...
6 篇 医学
- 4 篇 基础医学(可授医学...
- 4 篇 临床医学
- 3 篇 药学(可授医学、理...
3 篇 法学
- 3 篇 社会学
2 篇 农学
1 篇 经济学
1 篇 教育学
1 篇 艺术学

主题

40 篇 evolutionary alg...
29 篇 genetic algorith...
27 篇 problem solving
19 篇 traveling salesm...
12 篇 ant colony optim...
12 篇 optimization
10 篇 parallel algorit...
10 篇 artificial intel...
9 篇 genetic programm...
9 篇 combinatorial op...
8 篇 multi-objective ...
8 篇 evolutionary alg...
8 篇 computers
7 篇 computation by a...
7 篇 algorithm analys...
6 篇 theory
6 篇 genetic algorith...
6 篇 runtime analysis
5 篇 load balancing
5 篇 evolution strate...

机构

6 篇 univ adelaide sc...
4 篇 univ birmingham ...
3 篇 hasso plattner i...
3 篇 colorado state u...
3 篇 colorado state u...
3 篇 univ adelaide ad...
3 篇 univ stirling st...
2 篇 sobolev institut...
2 篇 univ adelaide op...
2 篇 sorbonne univ li...
2 篇 univ adelaide sc...
2 篇 univ dortmund do...
2 篇 univ paris 11 lr...
2 篇 univ hong kong d...
2 篇 tu dortmund dort...
2 篇 th koln inst dat...
2 篇 university of st...
2 篇 univ granada dep...
2 篇 college of artif...
2 篇 department of co...

作者

20 篇 neumann frank
9 篇 neumann aneta
9 篇 whitley darrell
7 篇 yao xin
7 篇 coello coello ca...
6 篇 doerr benjamin
5 篇 schoenauer marc
5 篇 bossek jakob
5 篇 cotta carlos
5 篇 ochoa gabriela
5 篇 teytaud olivier
5 篇 zaefferer martin
4 篇 bartz-beielstein...
4 篇 schoenauer m
4 篇 doerr carola
4 篇 sutton andrew m.
4 篇 hao jin-kao
4 篇 sudholt dirk
4 篇 hansen nikolaus
4 篇 kerschke pascal

语言

489 篇 英文
18 篇 其他
8 篇 中文
1 篇 乌克兰文

检索条件"任意字段=11th International Conference on Parallel Problem Solving from Nature"

共 511 条记录，以下是51-60 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

solving the Traveling Salesman problem with a Hybrid Quantum-Classical Feedforward Neural Network 1

引用

14th international conference on parallel Processing and Applied Mathematics, PPAM 2022

作者： Zawalska, Justyna Rycerz, Katarzyna Academic Computer Centre Cyfronet AGH ul. Nawojki 11 Krakow30-950 Poland Institute of Computer Science AGH al. Mickiewicza 30 Krakow30-059 Poland

ISBN: (数字)9783031304453

ISBN: (纸本)9783031304446

solving combinatorial optimization problems with the Quantum Approximate Optimization Algorithm (QAOA) is becoming more and more popular. the performance of the QAOA strongly depends on the initial parameters and the optimization procedure. this work presents a benchmark for solving the Traveling Salesman problem (TSP) that introduces a hybrid feedforward neural network as the QAOA’s optimization routine. the strength of this method lies in training the optimization procedure on many instances of the problem and using mini-batch updates of the parameters. Although the learning process is costly, the advantage of this method is that after the neural network is trained, it immediately returns optimized parameters for new problem instances. We present the advantage of our method by evaluating it on two sets of initial parameters. the experiments demonstrated that the proposed hybrid quantum-classical feedforward neural network can be successfully used to solve the TSP. © 2023, the Author(s), under exclusive license to Springer nature Switzerland AG.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Specification-Driven Evolution of Floor Plan Design 17th

Specification-Driven Evolution of Floor Plan Design

引用

17th international conference on parallel problem solving from nature (PPSN)

作者： Grzesiak-Kopec, Katarzyna Strug, Barbara Slusarczyk, Grazyna Jagiellonian Univ Inst Appl Comp Sci Ul Lojasiewicza 11 Krakow Poland

ISBN: (纸本)9783031147210;9783031147203

Generating floor plan designs is a challenging task that requires from an architect both engineering knowledge and creativity. Various computer-aided design tools are used to improve the efficiency of the design process, the most promising of which are intelligent computational models. In this paper a human-computer interaction based framework for multi-storey houses floor plan design is proposed, where the generation of possible solutions is driven by the evolutionary search directed by the user-defined criteria. the constraints and requirements specified by the user provide the basis for the definition of the requirement-weighted fitness function and can be modified during the evolution process. In the first stage of evolution the layouts for one floor are generated. Floor plans for other floors are generated in the next stage, which allows for introducing additional constraints regarding the position of structural elements (such as load-bearing walls or stairs) that cannot be mutated, and thus adjust these plans to the ones generated earlier. the genotypes of individuals are represented by the vectors of numerical values of points representing endpoints of room walls. this structure allows for representing any rectilinear rooms. A case study of the floor plan design for a two-storey house is presented.

关键词： Evolutionary design Floor plan optimization Design constraints and requirements

来源：评论

学校读者我要写书评

暂无评论

Fractal Dimension and Perturbation Strength: A Local Optima Networks View 17th

Fractal Dimension and Perturbation Strength: A Local Optima ...

引用

17th international conference on parallel problem solving from nature (PPSN)

作者： thomson, Sarah L. Ochoa, Gabriela Verel, Sebastien Univ Stirling Stirling Scotland Univ Littoral Cote Opale ULCO Dunkerque France

ISBN: (纸本)9783031147142;9783031147135

We study the effect of varying perturbation strength on the fractal dimensions of Quadratic Assignment problem (QAP) fitness landscapes induced by iterated local search (ILS). Fitness landscapes are represented as Local Optima Networks (LONs), which are graphs mapping algorithm search connectivity in a landscape. LONs are constructed for QAP instances and fractal dimension measurements taken from the networks. thereafter, the interplay between perturbation strength, LON fractal dimension, and algorithm difficulty on the underlying combinatorial problems is analysed. the results show that higher-perturbation LONs also have higher fractal dimensions. ILS algorithm performance prediction using fractal dimension features may benefit more from LONs formed using a high perturbation strength;this model configuration enjoyed excellent performance. Around half of variance in Robust Taboo Search performance on the data-set used could be explained with the aid of fractal dimension features.

关键词： Local Optima Network Fractal dimension Quadratic Assignment problem QAP Iterated local search Perturbation strength Fitness landscapes

来源：评论

学校读者我要写书评

暂无评论

Memory-Efficient BKW Algorithm for solving the LWE problem 28th

Memory-Efficient BKW Algorithm for Solving the LWE Problem

引用

28th IACR international conference on Practice and theory of Public Key Cryptography, PKC 2025

作者： Wei, Yu Bi, Lei Lu, Xianhui Wang, Kunpeng Key Laboratory of Cyberspace Security Defense Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783031918223

the study of attack algorithms for the Learning with Errors (LWE) problem is crucial for the cryptanalysis of LWE-based cryptosys tems. the BKW algorithm has gained significant attention as an impor tant combinatorial attack for solving LWE. However, its exponential time and memory requirements severely limit its practical applications, even with medium-sized parameters. In this paper, we present a memory efficient BKW algorithm for LWE, which extends Bogos’s work [Asi acrypt’16] on the Learning Parity with Noise (LPN) problem. While their work improved efficiency, it overlooked the high memory demands of the BKW algorithm. We address this with two key improvements. First, we propose an efficient reduction technique for low-memory regimes,. c-sum PCS-reduce, which combines the.c-sum technique with parallel Collision Search (PCS) to achieve a better time-memory trade-off. Second, we present an improved memory-optimized finite automaton for our opti mized BKW algorithm by incorporating several efficient memory-saving reduction techniques and pruning potential high-memory paths. Our algorithm, using graphs as a meta tool, can automatically identify the optimal reduction path within the graph, aiming to reduce both time and memory complexities. Compared to the state-of-the-art coded-BKW in the lattice-estimator, our algorithm achieves time complexity improve ments ranging from 23.3 to 226.2. Furthermore, memory complexity is improved, with reductions ranging from. 29.7 to 271.3. © international Association for Cryptologic Research 2025.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling problem 17th

Runtime Analysis of Simple Evolutionary Algorithms for the C...

引用

17th international conference on parallel problem solving from nature (PPSN)

作者： Shi, Feng Yan, Xiankun Neumann, Frank Cent South Univ Sch Comp Sci & Engn Changsha 410083 Peoples R China Univ Adelaide Sch Comp Sci Optimisat & Logist Adelaide SA Australia

ISBN: (纸本)9783031147210;9783031147203

the Makespan Scheduling problem is an extensively studied NP-hard problem, and its simplest version looks for an allocation approach for a set of jobs with deterministic processing times to two identical machines such that the makespan is minimized. However, in real life scenarios, the actual processing time of each job may be stochastic around an expected value with a variance under the influence of external factors, and these actual processing times may be correlated with covariances. thus within this paper, we propose a chance-constrained version of the Makespan Scheduling problem and investigate the performance of Randomized Local Search and (1 + 1) EA for it. More specifically, we study two variants of the Chance-constrained Makespan Scheduling problem and analyze the expected runtime of the two algorithms to obtain an optimal or almost optimal solution to the instances of the two variants.

关键词： Chance-constraint Makespan scheduling problem RLS (1+1) EA

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack problem with Stochastic Profits 17th

Evolutionary Algorithms for Limiting the Effect of Uncertain...

引用

17th international conference on parallel problem solving from nature (PPSN)

作者： Neumann, Aneta Xie, Yue Neumann, Frank Univ Adelaide Sch Comp Sci Optimisat & Logist Adelaide SA Australia

ISBN: (纸本)9783031147142;9783031147135

Evolutionary algorithms have been widely used for a range of stochastic optimization problems in order to address complex real-world optimization problems. We consider the knapsack problem where the profits involve uncertainties. Such a stochastic setting reflects important real-world scenarios where the profit that can be realized is uncertain. We introduce different ways of dealing with stochastic profits based on tail inequalities such as Chebyshev's inequality and Hoeffding bounds that allow to limit the impact of uncertainties. We examine simple evolutionary algorithms and the use of heavy tail mutation and a problem-specific crossover operator for optimizing uncertain profits. Our experimental investigations on different benchmarks instances show the results of different approaches based on tail inequalities as well as improvements achievable through heavy tail mutation and the problem specific crossover operator.

关键词： Stochastic knapsack problem Chance-constrained optimization Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Algorithm for Student-Project Allocation problem 11th

A Heuristic Algorithm for Student-Project Allocation Problem

引用

11th international conference on Computational Data and Social Networks, CSoNet 2022

作者： Uyen, Nguyen thi Nguyen, Giang L. Pham, Canh V. Sang, Tran Xuan Viet, Hoang Huu School of Engineering and Technology Vinh University Vinh City Viet Nam Institute of Information Technology VAST Hanoi Viet Nam ORLab Faculty of Computer Science Phenikaa University Hanoi Viet Nam Cyber School Vinh University Nghe An Vinh Viet Nam

ISBN: (纸本)9783031263026

the Student-Project Allocation problem with lecturer preferences over Students with Ties (SPA-ST) is to find a stable matching of students and projects to satisfy the constraints on student preferences over projects, lecturer preferences over students, and the maximum number of students given by each project and lecturer. this problem has attracted many researchers because of its wide applications in allocating students to projects at many universities worldwide. However, the main weakness of existing algorithms is their high computational cost. In this paper, we propose a heuristic algorithm to improve solution quality and execution time for solving the SPA-ST problem of large sizes. Experimental results on randomly generated datasets show that our algorithm outperforms the state-of-the-art algorithm regarding solution quality and execution time. © 2023, the Author(s), under exclusive license to Springer nature Switzerland AG.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Unified SAT-solving for Hard problems of Phylogenetic Network Construction 11th

Unified SAT-Solving for Hard Problems of Phylogenetic Netw...

引用

11th international conference on Computational Advances in Bio and Medical Sciences, ICCABS 2021

作者： Gusfield, Dan Brown, Hannah Computer Science Department University of California Davis United States Computer Science Department NUS Singapore Singapore

ISBN: (纸本)9783031175305

We developed a unified SAT-solving approach to three phylogenetic network construction problems that integer linear programming was not able to solve. We detail the CNF formulations for two: the Minimum-Reticulation problem, and the Hybridization-Network problem;and apply them to widely studied Grass data, and to randomly generated data. the results reduce the number of reticulations in 4 of the 18 Grass datasets, and improve the best SAT-based solutions in two more. We study the effectiveness of a method for speeding the solution to the Hybridization problem, and show that when it can be applied, it can be extremely effective. this work contributes to SAT-solving methodology, to phylogenetic network construction, and to the evolutionary history of Grasses. © 2022, the Author(s), under exclusive license to Springer nature Switzerland AG.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Computing High-Quality Solutions for the Patient Admission Scheduling problem Using Evolutionary Diversity Optimisation 17th

Computing High-Quality Solutions for the Patient Admission S...

引用

17th international conference on parallel problem solving from nature (PPSN)

作者： Nikfarjam, Adel Moosavi, Amirhossein Neumann, Aneta Neumann, Frank Univ Adelaide Sch Comp Sci Optimisat & Logist Adelaide SA Australia Univ Ottawa Telfer Sch Management 55 Laurier Ave E Ottawa ON K1N 6N5 Canada

ISBN: (纸本)9783031147142;9783031147135

Diversification in a set of solutions has become a hot research topic in the evolutionary computation community. It has been proven beneficial for optimisation problems in several ways, such as computing a diverse set of high-quality solutions and obtaining robustness against imperfect modeling. For the first time in the literature, we adapt the evolutionary diversity optimisation for a real-world combinatorial problem, namely patient admission scheduling. We introduce an evolutionary algorithm to achieve structural diversity in a set of solutions subjected to the quality of each solution, for which we design and evaluate three mutation operators. Finally, we demonstrate the importance of diversity for the aforementioned problem through a simulation.

关键词： Evolutionary diversity optimisation Combinatorial optimisation Real-world problem Admission scheduling

来源：评论

学校读者我要写书评

暂无评论

Modelling Electric Vehicle Routing problem with Heterogeneous Fleet for Simultaneous Pickup and Delivery 19thth

Modelling Electric Vehicle Routing Problem with Heterogeneo...

引用

19th international conference on Computer Aided Systems theory, EUROCAST 2024

作者： Gupta, Prateek Devanand Iannillo, Antonio Ken Meira, Jorge Augusto State, Radu D’Aversa, Danilo SnT University of Luxembourg 29 Av. John F. Kennedy Luxembourg City1855 Luxembourg Gulliver Luxembourg S.à r.l. Luxembourg City Luxembourg

ISBN: (纸本)9783031838873

Vehicles that run on fossil fuel emit numerous air pollutants, and transitioning from conventional vehicles to their electric counterparts within a transportation fleet significantly reduces overall emissions. Electric vehicles are now an economically viable mode of transportation with decreasing cost of batteries, increasing power output, and rapid expansion of charging infrastructure. Electric vehicle routing problem (EVRP) aims to create routing plans for customers using a fleet of electric vehicles with diverse battery constraints. this paper proposes a new mathematical model for solving simultaneous pickup and delivery vehicle routing using a heterogeneous electric and fossil fuel vehicle fleet. the model is tested on logistics partner data using a standard CPLEX solver. © the Author(s), under exclusive license to Springer nature Switzerland AG 2025.

关键词： Electric vehicles

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共52页 << < 2 3 4 5 6 7 8 9 10 11 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：