首页>外文会议>Special event on analysis of experimental algorithms

Special event on analysis of experimental algorithms

召开年：2019
召开地：Kalamata(GR)
出版时间：-

会议文集：-

会议论文

热门论文

全部论文

全选（0）

1.Quantum-Inspired Evolutionary Algorithms for Covering Arrays of Arbitrary Strength

机译：涵盖任意强度阵列的受量子启发的进化算法
- 作者：Michael Wagner;Ludwig Kampel;Dimitris E. Simos
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Optimization;
- Covering arrays;
- Quantum algorithms;
2.An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model

机译：恒定工作空间模型中测地线最短路径算法的实验研究
- 作者：Jonas Cleve;Wolfgang Mulzer
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Simple polygon;
- Geodesic shortest path;
- Constant workspace;
- Experimental evaluation;
3.Searching for Best Karatsuba Recurrences

机译：搜索最佳Karatsuba复发
- 作者：Çagdaş Çahk;Morris Dworkin;Nathan Dykas;Rene Peralta
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
4.Minimum and Maximum Category Constraints in the Orienteering Problem with Time Windows

机译：时间窗定向越野问题中的最小和最大类别约束
- 作者：Konstantinos Ameranis;Nikolaos Vathis;Dimitris Fotakis
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Orienteering;
- Local Search;
- Integer Programming;
- Heuristics;
- Category constraints;
5.Internal Versus External Balancing in the Evaluation of Graph-Based Number Types

机译：基于图的数字类型评估中的内部与外部平衡
- 作者：Hanna Geppert;Martin Wilhelm
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
6.Hacker's Multiple-Precision Integer-Division Program in Close Scrutiny

机译：严密审查黑客的多精度整数除法程序
- 作者：Jyrki Katajainen
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Software library;
- Multiple-precision arithmetic;
- Algorithm;
- Long division;
- Description;
- Implementation;
- Meticulous analysis;
- Experimentation;
7.Assessing Algorithm Parameter Importance Using Global Sensitivity Analysis

机译：使用全局灵敏度分析评估算法参数重要性
- 作者：Alessio Greco;Salvatore Danilo Riccio;Jon Timmis;Giuseppe Nicosia
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- NSGA-III;
- MOEA/D;
- Global Sensitivity Analysis;
- Elementary Effects;
- Sobol method;
- Variance Based Sensitivity Analysis;
8.A Machine Learning Framework for Volume Prediction

机译：一种用于体积预测的机器学习框架
- 作者：Umutcan OEnal;Zafeirakis Zafeirakopoulos
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Machine learning;
- Autoencoders;
- Neural networks;
- Polytope;
- Volume;
9.Faster Biclique Mining in Near-Bipartite Graphs

机译：近二部图中的更快的Biclique挖掘
- 作者：Blair D. Sullivan;Andrew van der Poel;Trey Woodlief
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Bicliques;
- Odd cycle transversal;
- Bipartite;
- Enumeration algorithms;
- Parameterized complexity;
10.k-Maximum Subarrays for Small k: Divide-and-Conquer Made Simpler

机译：小k的k个最大子数组：分而治之变得更简单
- 作者：Ovidiu Daescu;Hemant Malik
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- k-Maximum subarrays;
- Divide and conquer;
- X + Y;
- Sublinear;
11.A Faster Convex-Hull Algorithm via Bucketing

机译：一种基于桶的更快的凸包算法
- 作者：Ask Neve Gamby;Jyrki Katajainen
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Computational geometry;
- Convex hull;
- Algorithm;
- Bucketing;
- Linear expected time;
- Experimental evaluation;
12.Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem

机译：固定集搜索应用于最小加权顶点覆盖问题
- 作者：Raka Jovanovic;Stefan Voβ
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Metaheuristics;
- Minimum Weighted Vertex Cover Problem;
- GRASP;
- Fixed set search;
13.Automated Deep Learning for Threat Detection in Luggage from X-Ray Images

机译：自动深度学习，用于从X射线图像检测行李中的威胁
- 作者：Alessio Petrozziello;Ivan Jordanov
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Baggage screening;
- Deep learning;
- Convolutional neural networks;
- Image filtering;
- Object detection algorithms;
- X-ray images;
14.Algorithmic Aspects on the Construction of Separating Codes

机译：分隔码构造的算法方面
- 作者：Marcel Fernandez;John Livieratos
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Separating codes;
- Lovasz Local Lemma;
- Moser-Tardos constructive proof;
15.Lagrangian Relaxation in Iterated Local Search for the Workforce Scheduling and Routing Problem

机译：迭代局部搜索中的拉格朗日松弛法，用于劳动力调度和路由问题
- 作者：Hanyu Gu;Yefei Zhang;Yakov Zinder
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Iterated local search;
- Lagrangian relaxation;
- Workforce Scheduling and Routing;
16.Approximation Algorithms and an Integer Program for Multi-level Graph Spanners

机译：多级图扳手的逼近算法和整数程序
- 作者：Reyan Ahmed;Keaton Hamm;Mohammad Javad Latifi Jebelli;Stephen Kobourov;Faryad Darabi Sahneh;Richard Spence
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Graph spanners;
- Integer programming;
- Multi-level graph representation;
17.Preface

机译：前言
- 作者：Ilias Kotsireas;Panos Pardalos;Konstantinos E. Parsopoulos;Dimitris Souravlias;Arsenis Tsokas
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
18.Voronoi Diagram of Orthogonal Polyhedra in Two and Three Dimensions

机译：二维和三维正交多面体的Voronoi图
- 作者：Ioannis Z. Emiris;Christina Katsamaki
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Max norm;
- Axis-aligned;
- Rectilinear;
- Straight skeleton;
- Subdivision method;
- Numeric implementation;
19.The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation

机译：和弦图的子树相交表示和线性时间和弦图生成的复杂性
- 作者：Tmaz Ekim;Mordechai Shalom;Oylum Şeker
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Chordal graph;
- Representation complexity;
- Graph generation;
20.Computing a Minimum Color Path in Edge-Colored Graphs

机译：计算边缘色图中的最小颜色路径
- 作者：Neeraj Kumar
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
21.Student Course Allocation with Constraints

机译：有约束的学生课程分配
- 作者：Akshay Utture;Vedant Somani;Prem Krishnaa;Meghana Nasre
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
22.A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem

机译：最小-最大后悔生成树问题的组合分支和界
- 作者：Noe Godinho;Luis Paquete
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Min-max regret criterion;
- Multi-objective optimization;
- Minimum Spanning Tree;
- Branch and bound;
23.Navigating a Shortest Path with High Probability in Massive Complex Networks

机译：在大规模复杂网络中以高概率导航最短路径
- 作者：Jun Liu;Yicheng Pan;Qifu Hu;Angsheng Li
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Navigation;
- Shortest path;
- Massive networks;
24.Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs

机译：为平面图中的最小反馈顶点集设计PTAS
- 作者：Glencora Borradaile;Hung Le;Baigong Zheng
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Feedback vertex set;
- Planar graph algorithms;
- Approximation schemes;
- Algorithm engineering;
25.On New Rebalancing Algorithm

机译：关于新的平衡算法
- 作者：Koba Gelashvili;Nikoloz Grdzelidze;Mikheil Tutberidze
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Binary search tree;
- RB-tree;
- DSW algorithm;
- Sedgewick balancing algorithm;
26.Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs

机译：基于多彩边疆的搜索：和弦和间隔子图的隐式枚举
- 作者：Jun Kawahara;Toshiki Saitoh;Hirofumi Suzuki;Ryo Yoshinaka
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Graph algorithm;
- Graph enumeration;
- Decision diagram;
- Frontier-based search;
- Interval graph;
- Chordal graph;
27.Unit Disk Cover for Massive Point Sets

机译：用于大容量点集的单元盘盖
- 作者：Anirban Ghosh;Brian Hicks;Ronald Shevchenko
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Geometric covering;
- Unit disks;
- Clustering;
28.Improved Contraction Hierarchy Queries via Perfect Stalling

机译：通过完善的停顿改进了收缩层次结构查询
- 作者：Stefan Funke;Thomas Mendel
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Shortest path;
- Contraction Hierarchies;
29.Constraint Generation Algorithm for the Minimum Connectivity Inference Problem

机译：最小连通性推理问题的约束生成算法
- 作者：Edouard Bonnet;Diana-Elena Falamaş;Remi Watrigant
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Hypergraph;
- Constraint generation algorithm;
- Connectivity problem;
30.Efficient Split-Radix and Radix-4 DCT Algorithms and Applications

机译：高效的拆分基数和Radix-4 DCT算法和应用
- 作者：Sirani M. Perera;Daniel Silverio;Austin Ogle
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
31.Analysis of Max-Min Ant System with Local Search Applied to the Asymmetric and Dynamic Travelling Salesman Problem with Moving Vehicle

机译：车辆搜索的非对称动态旅行商问题局部搜索最大最小蚂蚁系统分析
- 作者：João P. Schmitt;Rafael S. Parpinelli;Fabiano Baldo
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Computational optimization;
- Swarm intelligence;
- Hybrid methods;
- Dynamic problems;
32.Computing Treewidth via Exact and Heuristic Lists of Minimal Separators

机译：通过最小分隔符的精确列表和启发式列表计算树宽
- 作者：Hisao Tamaki
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
33.Fast Public Transit Routing with Unrestricted Walking Through Hub Labeling

机译：通过集线器标签无限制步行的快速公共交通路由
- 作者：Duc-Minh Phan;Laurent Viennot
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Route planning;
- Public transportation;
- Hub labeling;
34.Effective Heuristics for Matchings in Hypergraphs

机译：超图匹配中的有效启发式
- 作者：Fanny Dufosse;Kamer Kaya;Ioannis Panagiotas;Bora Uçar
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- d-dimensional matching;
- Tensor scaling;
- Matching in hypergraphs;
- Karp-Sipser heuristic;
35.Approximated ZDD Construction Considering Inclusion Relations of Models

机译：考虑模型包含关系的近似ZDD构造
- 作者：Kotaro Matsuda;Shuhei Denzumi;Kengo Nakamura;Masaaki Nishino;Norihito Yasuda
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Zero-suppressed binary decision diagrams;
- Probabilistic data structure;
- Enumeration;
36.Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem

机译：子图同构问题的颜色编码算法的有效实现
- 作者：Josef Malik;Ondrej Suchy;Tomas Valla
- 会议名称：《Special event on analysis of experimental algorithms》 | 2019年
- Subgraph isomorphism;
- Subgraph enumeration;
- Color coding;
- Tree decomposition;
- Treewidth;