咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 3 篇 理学
    • 2 篇 数学
    • 1 篇 生物学
  • 3 篇 工学
    • 3 篇 计算机科学与技术...
    • 1 篇 软件工程
  • 1 篇 农学

主题

  • 4 篇 approximated alg...
  • 1 篇 spatial data
  • 1 篇 subspace decompo...
  • 1 篇 ant colony optim...
  • 1 篇 asymptotic conve...
  • 1 篇 computational ge...
  • 1 篇 stream summary
  • 1 篇 convex hull
  • 1 篇 incremental algo...
  • 1 篇 genome median pr...
  • 1 篇 data streams
  • 1 篇 phylogenetic rec...
  • 1 篇 sketch
  • 1 篇 travel salesman ...
  • 1 篇 data structures
  • 1 篇 scaling

机构

  • 1 篇 cnr ist anal sis...
  • 1 篇 univ estadual ca...
  • 1 篇 swiss fed inst t...
  • 1 篇 univ aquila dipa...
  • 1 篇 politecn torino ...
  • 1 篇 ntu singapore sc...
  • 1 篇 univ rome la sap...
  • 1 篇 oracle labs
  • 1 篇 scylla bioinform...

作者

  • 1 篇 pereira zanetti ...
  • 1 篇 talamo maurizio
  • 1 篇 gaibisso carlo
  • 1 篇 biller priscila
  • 1 篇 alonso gustavo
  • 1 篇 meidanis joao
  • 1 篇 franciosa paolo ...
  • 1 篇 gambosi giorgio
  • 1 篇 roy pratanu
  • 1 篇 khan arijit
  • 1 篇 scianna marco

语言

  • 3 篇 英文
  • 1 篇 其他
检索条件"主题词=approximated algorithms"
4 条 记 录,以下是1-10 订阅
排序:
The AddACO: A bio-inspired modified version of the ant colony optimization algorithm to solve travel salesman problems
收藏 引用
MATHEMATICS AND COMPUTERS IN SIMULATION 2024年 218卷 357-382页
作者: Scianna, Marco Politecn Torino Math Sci Corso Duca Abruzzi 24 I-10129 Turin Italy
The Travel Salesman Problem (TSP) consists in finding the minimal-length closed tour that connects the entire group of nodes of a given graph. We propose to solve such a combinatorial optimization problem with the Add... 详细信息
来源: 评论
Median Approximations for Genomes Modeled as Matrices
收藏 引用
BULLETIN OF MATHEMATICAL BIOLOGY 2016年 第4期78卷 786-814页
作者: Pereira Zanetti, Joao Paulo Biller, Priscila Meidanis, Joao Univ Estadual Campinas Inst Comp Campinas SP Brazil Scylla Bioinformat Campinas SP Brazil
The genome median problem is an important problem in phylogenetic reconstruction under rearrangement models. It can be stated as follows: Given three genomes, find a fourth that minimizes the sum of the pairwise rearr... 详细信息
来源: 评论
A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 1994年 第2期4卷 153-163页
作者: Franciosa, Paolo Giulio Gaibisso, Carlo Gambosi, Giorgio Talamo, Maurizio Univ Rome La Sapienza Dipartimento Infomat & Sistemist I-00198 Rome Italy CNR Ist Anal Sistemi & Informat I-00185 Rome Italy Univ Aquila Dipartimento Matemat Pura & Applicata I-67010 Laquila Italy
We consider the problem of deriving good approximations of the convex hull of a set of points in the plane in the realistic case that only arbitrary finite approximations of the real valued coordinates can be known. I... 详细信息
来源: 评论
Augmented Sketch: Faster and More Accurate Stream Processing  16
Augmented Sketch: Faster and More Accurate Stream Processing
收藏 引用
ACM SIGMOD International Conference on Management of Data
作者: Roy, Pratanu Khan, Arijit Alonso, Gustavo Swiss Fed Inst Technol Syst Grp Comp Sci Zurich Switzerland NTU Singapore Sch Comp Engn Singapore Singapore Oracle Labs Zurich Switzerland
approximated algorithms are often used to estimate the frequency of items on high volume, fast data streams. The most common ones are variations of Count-Min sketch, which use sub-linear space for the count, but can p... 详细信息
来源: 评论