首页>外文会议>Annual conference on theory and applications of models of computation

Annual conference on theory and applications of models of computation

召开年：2017
召开地：Bern(CH)
出版时间：-

会议文集：-

会议论文

热门论文

全部论文

全选（0）

1.Cognitive Reasoning and Trust in Human-Robot Interactions

机译：人机交互中的认知推理和信任
- 作者：Marta Kwiatkowska
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
2.On Choice Rules in Dependent Type Theory

机译：相依类型理论中的选择规则
- 作者：Maria Emilia Maietti
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
3.Natural Language Processing, Moving from Rules to Data

机译：自然语言处理，从规则到数据的转换
- 作者：Adrian-Horia Dediu;Joana M. Matos;Carlos Martin-Vide
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Computational models;
- Computational linguistics;
- Speech processing methods;
- Machine translation;
4.An All-or-Nothing Flavor to the Church-Turing Hypothesis

机译：教堂转向假说的全有或全无
- 作者：Stefan Wolf
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
5.Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis

机译：具有FPT子例程的涡轮增压支配装置：进一步的改进和实验分析
- 作者：Faisal N. Abu-Khzam;Shaowei Cai;Judith Egan;Peter Shaw;Kai Wang
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
6.Multi-interval Pairwise Compatibility Graphs (Extended Abstract)

机译：多间隔成对兼容性图（扩展摘要）
- 作者：Shareef Ahmed;Md. Saidur Rahman
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Pairwise compatibility graphs;
- Phylogenetic trees;
- Series-parallel graphs;
7.A Note on Effective Categoricity for Linear Orderings

机译：关于线性订购有效有效度的一个注记
- 作者：Nikolay Bazhenov
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
8.On the Shortest Common Superstring of NGS Reads

机译：关于NGS阅读的最短公共超串
- 作者：Tristan Braquelaire;Marie Gasparoux;Mathieu Raffinot;Raluca Uricaru
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Shortest Superstring Problem;
- Approximation algorithms;
- Next Generation Sequencing;
9.On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One

机译：用块序一模拟并行布尔自动机网络的代价
- 作者：Florian Bridoux;Pierre Guillon;Kevin Perrot;Sylvain Sene;Guillaume Theyssier
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Boolean automata networks;
- Intrinsic simulation;
- Block-sequential update schedules;
10.On Resource-Bounded Versions of the van Lambalgen Theorem

机译：van Lambalgen定理的资源有界版本
- 作者：Diptarka Chakraborty;Satyadev Nandakumar;Himanshu Shukla
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
11.Scheduling Fully Parallel Jobs with Integer Parallel Units

机译：使用整数并行单元调度完全并行作业
- 作者：Vincent Chau;Minming Li;Kai Wang
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
12.Continuous Firefighting on Infinite Square Grids

机译：在无限方格上连续灭火
- 作者：Xujin Chen;Xiaodong Hu;Changjun Wang;Ying Zhang
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Firefighter problem;
- Continuous firefighting;
- Fire containment;
- Infinite square grids;
13.Mediated Population Protocols: Leader Electior and Applications

机译：中介的人口协议：领导电子及其应用
- 作者：Shantanu Das;Giuseppe Antonio Di Luna;Paola Flocchini;Nicola Santoro;Giovanni Viglietta
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
14.Learning AC~0 Under k-Dependent Distributions

机译：在k依赖分布下学习AC〜0
- 作者：Ning Ding;Yanli Ren;Dawu Gu
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
15.Parikh Images of Matrix Ins-Del Systems

机译：矩阵Ins-Del系统的Parikh图像
- 作者：Henning Fernau;Lakshmanan Kuppusamy
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Parikh images;
- Semilinearity;
- Ins-del systems;
- Matrix grammars;
16.Algorithmic Aspects of the Maximum Colorful Arborescence Problem

机译：最大彩色树状结构问题的算法方面
- 作者：Guillaume Fertin;Julien Fradin;Geraldine Jean
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
17.Incompleteness Theorems, Large Cardinals, and Automata over Finite Words

机译：不完整定理，大基数和有限词自动机
- 作者：Olivier Finkel
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
18.Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity

机译：计划任务以最大程度地减少无限容量处理器上的活动时间
- 作者：Ken C.K. Fong;Minming Li;Yungao Li;Sheung-Hung Poon;Weiwei Wu;Yingchao Zhao
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
19.The Strength of the SCT Criterion

机译：SCT标准的优势
- 作者：Emanuele Frittaion;Silvia Steila;Keita Yokoyama
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Ramsey's theorem for pairs;
- Size-change termination;
- Reverse Mathematics;
- Σ_2~0-induction;
20.Covering Polygons with Rectangles

机译：用矩形覆盖多边形
- 作者：Roland Gliick
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
21.The Complexity of Perfect Packings in Dense Graphs

机译：密集图中完美堆积的复杂性
- 作者：Jie Han
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Perfect packing;
- Computational complexity;
- Absorbing method;
22.On the Maximum Weight Minimal Separator

机译：在最大重量最小分离器上
- 作者：Tesshu Hanaka;Hans L. Bodlaender;Tom C. van der Zanden;Hirotaka Ono
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Parameterized algorithm;
- Minimal separator;
- Treewidth;
23.Pebble Games over Ordered Structural Abstractions

机译：有序结构抽象上的卵石游戏
- 作者：Yuguo He
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Finite model theory;
- Pebble games;
- Structural abstraction;
24.Counting Minimal Dominating Sets

机译：计算最小的支配集
- 作者：Mamadou Moustapha Kante;Takeaki Uno
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
25.On the Computational Complexity of Variants of Combinatorial Voter Control in Elections

机译：选举中组合选民控制变量的计算复杂性
- 作者：Leon Kellerhals;Viatcheslav Korenwein;Philipp Zschoche;Robert Bredereck;Jiehua Chen
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
26.On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas

机译：2CNF公式中一次读取分辨率决定性的计算复杂性
- 作者：Hans Kleine Buning;Piotr Wojciechowski;K. Subramani
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- 2SAT;
- Resolution;
- Read-once;
27.Vector Ambiguity and Freeness Problems in SL(2,Z)

机译：SL（2，Z）中的向量歧义和自由问题
- 作者：Sang-Ki Ko;Igor Potapov
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Matrix semigroup;
- SL(2,Z);
- Vector ambiguity;
- Vector freeness;
- Decidability;
- NP-completeness;
28.An O(n~2) Algorithm for Computing Optimal Continuous Voltage Schedules

机译：O（n〜2）算法计算最佳连续电压表
- 作者：Minming Li;Prances F. Yao;Hao Yuan
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
29.Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution

机译：走向布尔卷积单调电路复杂度的几乎二次下界
- 作者：Andrzej Lingas
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Semi-disjoint bilinear form;
- Boolean vector convolution;
- Monotone Boolean circuit complexity;
30.Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model

机译：单位成本计算模型中半不相交双线性形式的界
- 作者：Andrzej Lingas;Mia Persson;Dzmitry Sledneu
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Semi-disjoint bilinear form;
- Semi-ring;
- Vector convolution;
- Matrix multiplication;
- Distance product;
- Circuit complexity;
- Unit-cost ram;
- Time complexity;
31.Bounding the Dimension of Points on a Line

机译：界定直线上点的尺寸
- 作者：Neil Lutz;D.M. Stull
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
32.Buchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order

机译：Buchi自动机识别具有加法和阶数的一阶逻辑中可定义的实数集
- 作者：Arthur Milchior
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
33.qPCF: A Language for Quantum Circuit Computations

机译：qPCF：一种用于量子电路计算的语言
- 作者：Luca Paolini;Margherita Zorzi
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
34.Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions

机译：通过边缘收缩和顶点删除为无H图阻塞独立集
- 作者：Daniel Paulusma;Christophe Picouleau;Bernard Ries
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
35.A Density Theorem for Hierarchies of Limit Spaces over Separable Metric Spaces

机译：可分度量空间上极限空间层次的一个密度定理
- 作者：Iosif Petrakis
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
36.On the Conjecture of the Smallest 3-Cop-Win Planar Graph

机译：关于最小3 Cop Win平面图的猜想
- 作者：Photchchara Pisantechakool;Xuehou Tan
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Cops and Robbers game;
- Cop number;
- Capture strategy;
- Winning vertices;
37.On Complexity of Total Vertex Cover on Subcubic Graphs

机译：次三次图上总顶点覆盖的复杂度
- 作者：Sheung-Hung Poon;Wei-Lin Wang
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
38.Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract)

机译：随机布尔函数的不确定通信复杂度（扩展摘要）
- 作者：Mozhgan Pourmoradnasseri;Dirk Oliver Theis
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Communication complexity;
- Random structures;
39.The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization

机译：非整数双准则优化中的帕累托最优解的光滑数
- 作者：Heiko Roglin;Clemens Rosner
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
40.From Nonstandard Analysis to Various Flavours of Computability Theory

机译：从非标准分析到可计算性理论的各种形式
- 作者：Sam Sanders
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
41.Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs

机译：有向图的最小化超线性多项式代价的路由难度
- 作者：Yangguang Shi;Fa Zhang;Zhiyong Liu
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Hardness of approximation;
- Superlinear polynomial cost;
- Directed graphs;
- Network energy efficiency;
42.A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds

机译：正则表达式的密码学观点：更简单的统一证明和精确边界
- 作者：Maciej Skorski
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Regularity lemmas;
- Boosting;
- Low-complexity approximations;
- Convex optimization;
- Computational indistinguishability;
43.On the Complexity of Breaking Pseudoentropy

机译：关于打破伪熵的复杂性
- 作者：Maciej Skorski
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Nonuniform attacks;
- Pseudoentropy;
- Smooth entropy;
- Hardness of boolean functions;
44.Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems

机译：求解凸多边形序列和相关问题的高效算法
- 作者：Xuehou Tan;Bo Jiang
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
45.Parameterized Complexity of Fair Deletion Problems

机译：公平删除问题的参数化复杂度
- 作者：Tomas Masafik;Tomas Toufar
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
46.Degrees of Word Problem for Algebras Without Finitely Presented Expansions

机译：没有有限表示扩展的代数的单词问题度
- 作者：Guohua Wu;Huishan Wu
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
- Computably enumerable universal algebra;
- Finitely presented expansion;
- Word problem;
47.Kernelization and Parameterized Algorithms for 3-Path Vertex Cover

机译：3路径顶点覆盖的内核化和参数化算法
- 作者：Mingyu Xiao;Shaowei Kou
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
48.Fast Searching on Cartesian Products of Graphs

机译：快速搜索图的笛卡尔积
- 作者：Yuan Xue;Boting Yang
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
49.Sequentialization Using Timestamps

机译：使用时间戳序列化
- 作者：Anand Yeolekar;Kumar Madhukar;Dipali Bhutada;R. Venkatesh
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
50.Preface

机译：前言
- 作者：T.V. Gopal;Gerhard Jager;Silvia Steila
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
51.Cognitive Reasoning and Trust in Human-Robot Interactions

机译：人机交互中的认知推理和信任
- 作者：Marta Kwiatkowska
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
52.Approximate Counting via Correlation Decay

机译：通过相关衰减进行近似计数
- 作者：Pinyan Lu
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
53.On Extraction of Programs from Constructive Proofs

机译：从构造证明中提取程序
- 作者：Maria Emilia Maietti
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
54.Computational Complexity for Real Valued Graph Parameters

机译：实值图参数的计算复杂度
- 作者：Johann A. Makowsky
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
55.Natural Language Processing, Moving from Rules to Data

机译：自然语言处理，从规则到数据的转换
- 作者：Carlos Martin-Vide
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
56.An All-or-Nothing Flavor to the Church-Turing Hypothesis

机译：教会转向假说的全有或全无
- 作者：Stefan Wolf
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年
57.Computing on Streams and Analog Networks

机译：流和模拟网络上的计算
- 作者：Jeffery Zucker
- 会议名称：《Annual conference on theory and applications of models of computation》 | 2017年