咨询与建议

限定检索结果

文献类型

  • 14 篇 期刊文献
  • 1 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 10 篇 工学
    • 10 篇 计算机科学与技术...
    • 2 篇 软件工程
    • 1 篇 控制科学与工程
  • 9 篇 理学
    • 9 篇 数学
  • 4 篇 管理学
    • 4 篇 管理科学与工程(可...

主题

  • 15 篇 experimental ana...
  • 2 篇 routing
  • 2 篇 approximation al...
  • 2 篇 computational bi...
  • 2 篇 combinatorial op...
  • 2 篇 scheduling
  • 1 篇 experimentation
  • 1 篇 performance
  • 1 篇 meta-heuristic
  • 1 篇 multiple alignme...
  • 1 篇 0-1 quadratic pr...
  • 1 篇 probability dist...
  • 1 篇 equivalent formu...
  • 1 篇 simulation
  • 1 篇 operations resea...
  • 1 篇 location managem...
  • 1 篇 set covering pro...
  • 1 篇 debugging
  • 1 篇 delaunay triangu...
  • 1 篇 algorithms

机构

  • 1 篇 cuny grad ctr de...
  • 1 篇 amherst college ...
  • 1 篇 georgia state un...
  • 1 篇 cuny brooklyn co...
  • 1 篇 dipartimento di ...
  • 1 篇 tech univ darmst...
  • 1 篇 iowa state univ ...
  • 1 篇 blees spoo z sta...
  • 1 篇 at&t labs res in...
  • 1 篇 justsyst pittsbu...
  • 1 篇 univ. di roma “l...
  • 1 篇 physics departme...
  • 1 篇 univ montreal ct...
  • 1 篇 isr5 los alamos ...
  • 1 篇 northwestern pol...
  • 1 篇 simon fraser uni...
  • 1 篇 univ fed flumine...
  • 1 篇 ben gurion univ ...
  • 1 篇 iowa state univ ...
  • 1 篇 calif state univ...

作者

  • 1 篇 bar-noy amotz
  • 1 篇 resende mgc
  • 1 篇 pecin diego
  • 1 篇 myller michal
  • 1 篇 mcdaniel emma l.
  • 1 篇 pasqualone giuli...
  • 1 篇 frigioni daniele
  • 1 篇 pandey pooja
  • 1 篇 punnen abraham p...
  • 1 篇 akwafuo sampson
  • 1 篇 pessoa artur
  • 1 篇 kececioglu j
  • 1 篇 loffreda mario
  • 1 篇 carpenter neal
  • 1 篇 seppäläinen t
  • 1 篇 nanni umberto
  • 1 篇 slutzki g
  • 1 篇 cohen jacques
  • 1 篇 lang jan christi...
  • 1 篇 bianchi l

语言

  • 14 篇 英文
  • 1 篇 其他
检索条件"主题词=Experimental analysis of algorithms"
15 条 记 录,以下是1-10 订阅
排序:
OREX-J: towards a universal software framework for the experimental analysis of optimization algorithms
收藏 引用
OR SPECTRUM 2013年 第3期35卷 735-769页
作者: Lang, Jan Christian Widjaja, Thomas Tech Univ Darmstadt Chair Operat Res Dept Law Business & Econ D-64289 Darmstadt Germany Tech Univ Darmstadt Chair Informat Syst Dept Law Business & Econ D-64289 Darmstadt Germany
The Operations Research EXperiment Framework for Java (OREX-J) is an object-oriented software framework that helps users to design, implement and conduct computational experiments for the analysis of optimization algo... 详细信息
来源: 评论
experimental analysis of Dynamic algorithms for the Single Source Shortest Paths Problem
收藏 引用
ACM Journal of experimental Algorithmics 1998年 3卷 5-5页
作者: Frigioni, Daniele loffreda, Mario Nanni, Umberto Pasqualone, Giulio Univ. di Roma “La Sapienza”
In this paper we propose the first experimental study of the fully dynamic single-source shortest-paths problem on directed graphs with positive real edge weights. In particular, we perform an experimental analysis of... 详细信息
来源: 评论
EXACT AND APPROXIMATION algorithms FOR SORTING BY REVERSALS, WITH APPLICATION TO GENOME REARRANGEMENT
收藏 引用
ALGORITHMICA 1995年 第1-2期13卷 180-210页
作者: KECECIOGLU, J SANKOFF, D UNIV MONTREAL CTR RECH MATHMONTREAL H3C 3J7PQCANADA
Motivated by the problem in computational biology of reconstructing the series of chromosome inversions by which one organism evolved from another, we consider the problem of computing the shortest series of reversals... 详细信息
来源: 评论
Standardized validation of vehicle routing algorithms
收藏 引用
APPLIED INTELLIGENCE 2024年 第2期54卷 1335-1364页
作者: Jastrzab, Tomasz Myller, Michal Tulczyjew, Lukasz Blocho, Miroslaw Kawulok, Michal Czornik, Adam Nalepa, Jakub Silesian Tech Univ Akad 16 PL-44100 Gliwice Poland Blees Spoo Z Starego 27A Gliwice Poland
Designing routing schedules is a pivotal aspect of smart delivery systems. Therefore, the field has been blooming for decades, and numerous algorithms for this task have been proposed for various formulations of rich ... 详细信息
来源: 评论
Probability distribution of solution time in GRASP: An experimental investigation
收藏 引用
JOURNAL OF HEURISTICS 2002年 第3期8卷 343-373页
作者: Aiex, RM Resende, MGC Ribeiro, CC Catholic Univ Rio de Janeiro Dept Comp Sci BR-22453900 Rio De Janeiro Brazil AT&T Labs Res Informat Sci Res Ctr Florham Pk NJ 07932 USA
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a sub-optimal target value in five GRASPs... 详细信息
来源: 评论
New benchmark instances for the Capacitated Vehicle Routing Problem
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2017年 第3期257卷 845-858页
作者: Uchoa, Eduardo Pecin, Diego Pessoa, Artur Poggi, Marcus Vidal, Thibaut Subramanian, Anand Univ Fed Fluminense Dept Engn Prod Rua Passo da Patria156 Sao DomingosBloco E BR-24210240 Niteroi RJ Brazil Pontificia Univ Catolica Rio de Janeiro Dept Informat Rua Marques Sao Vicente 225 BR-22451900 Rio De Janeiro RJ Brazil Univ Fed Paraiba Ctr Informat Dept Sistemas Comp Rua Escoteiros BR-58058600 Joao Pessoa Paraiba Brazil
The recent research on the CVRP is being slowed down by the lack of a good set of benchmark instances. The existing, sets suffer from at least one of the following drawbacks: (i) became too easy for current algorithms... 详细信息
来源: 评论
A comparison of sequential Delaunay triangulation algorithms
收藏 引用
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 1997年 第5-6期7卷 361-385页
作者: Su, P Drysdale, RLS JUSTSYST PITTSBURGH RES CTR PITTSBURGHPA 15213 DARTMOUTH COLL DEPT COMP SCISUDIKOFF LAB 6211HANOVERNH 03755
This paper presents an experimental comparison of a number of different algorithms for computing the Delaunay triangulation. The algorithms examined are: Dwyer's divide and conquer algorithm, Fortune's sweepli... 详细信息
来源: 评论
Core instances for testing: A case study
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2005年 第1期166卷 51-62页
作者: Mastrolilli, M Bianchi, L IDSIA CH-6928 Manno Switzerland
Data generation for computational testing of optimization algorithms is a key topic in experimental algorithmics. Recently, concern has arisen that many published computational experiments are inadequate with respect ... 详细信息
来源: 评论
Bounds for parametric sequence comparison
收藏 引用
DISCRETE APPLIED MATHEMATICS 2002年 第3期118卷 181-198页
作者: Fernández-Baca, D Seppäläinen, T Slutzki, G Iowa State Univ Sci & Technol Dept Comp Sci Ames IA 50011 USA Iowa State Univ Sci & Technol Dept Math Ames IA 50011 USA
We consider the problem of computing a global alignment between two or more sequences subject to varying mismatch and indel penalties. We prove a tight 3(n/2pi)(2/3) + O(n(1/3)log n) bound on the worst-case number of ... 详细信息
来源: 评论
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Paging Multiple Users in Cellular Network: Yellow Page and C...
收藏 引用
9th International Symposium on experimental algorithms
作者: Bar-Noy, Amotz Cheilaris, Panagiotis Feng, Yi CUNY Grad Ctr Dept Comp Sci 365 5th Ave New York NY 10016 USA CUNY Brooklyn Coll Dept Comp & Informat Sci Brooklyn NY 11210 USA Ben Gurion Univ Negev Ctr Adv Studies Math Dept Math IL-84105 Beer Sheva Israel
Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are independent. The task is to find any one, or all, of ... 详细信息
来源: 评论