全部文献期刊会议图书|学者科研项目
中外文文献  中文文献  外文文献
作者:Hai Liu , Zhenqiang Wu , Changgen Peng ...
来源:[J].Theoretical Computer Science(IF 0.489), 2020, Vol.816, pp.195-220
摘要:Abstract(#br)Differential privacy can achieve the tradeoff between privacy and utility by using privacy metric and utility metric. However, since privacy metric and utility metric may not be bounded, differential privacy can not provide the bounded tradeoff. Moreover, there is no...
作者:Jannik Castenow , Matthias Fischer , Jonas Harbig ...
来源:[J].Theoretical Computer Science(IF 0.489), 2020, Vol.815, pp.289-309
摘要:Abstract(#br)We consider a swarm of n autonomous mobile robots distributed on a 2-dimensional grid. A basic task for such a swarm is to perform the gathering process: All robots have to gather at one not predefined place. On the grid there are configurations which, due to sy...
作者:Jérémy Barbay , Pablo Pérez-Lantero , Javiel Rojas-Ledesma
来源:[J].Theoretical Computer Science(IF 0.489), 2020, Vol.815, pp.270-288
摘要:Abstract(#br)Given a set B of d -dimensional boxes (i.e., axis-aligned hyperrectangles), a minimum coverage kernel is a subset of B of minimum size covering the same region as B . Computing it is NP -hard, but as for many similar NP -hard problems (e.g., Box Cover , and Orth...
作者:Salma Sadat Mahdavi , Saeed Seddighin , Mohammad Ghodsi
来源:[J].Theoretical Computer Science(IF 0.489), 2020, Vol.815, pp.163-181
摘要:Abstract(#br)In this paper, we consider a new variant of covering in an orthogonal art gallery problem where each guard is a sliding k -transmitter. Such a guard can travel back and forth along an orthogonal line segment, say s , inside the polygon. A point p is covered by t...
作者:Lise Rommel Romero Navarrete , Guilherme P. Telles
来源:[J].Theoretical Computer Science(IF 0.489), 2020, Vol.815, pp.95-108
摘要:Abstract(#br)The regular expression constrained sequence alignment problem is that of producing an optimal score alignment of two sequences which, at the same time, has aligned portions that are both described by a regular expression.(#br)In this article we introduce a serie...
作者:Catherine C. McGeoch
来源:[J].Theoretical Computer Science(IF 0.489), 2020, Vol.816, pp.169-183
摘要:Abstract(#br)This paper introduces basic concepts of annealing-based quantum computing, also known as adiabatic quantum computing (AQC) and quantum annealing (QA), and surveys what is known about this novel computing paradigm. Extensive empirical research on physical quantum anne...
作者:Mingyu Xiao , Zimo Sheng
来源:[J].Theoretical Computer Science(IF 0.489), 2020, Vol.815, pp.109-120
摘要:Abstract(#br)A mixed domination of a graph G = ( V , E ) is a mixed set D of vertices and edges such that for every edge or vertex, if it is not in D , then it is adjacent or incident to at least one vertex or edge in D . The Mixed Domination problem is to check whether ther...
作者:Yinxia Sun , Yi Mu , Willy Susilo ...
来源:[J].Theoretical Computer Science(IF 0.489), 2020, Vol.815, pp.11-24
摘要:Abstract(#br)The utmost important problem in identity-based cryptosystems is the issue of user revocation. One of the existing solutions in the literature is to issue extra time keys periodically for every non-revoked user over public channels. Unfortunately, this solution is ine...
作者:Linqiang Pan , David Orellana-Martín , Bosheng Song ...
来源:[J].Theoretical Computer Science(IF 0.489), 2020, Vol.816, pp.1-18
摘要:Abstract(#br)P systems with active membranes are a class of computation models in the area of membrane computing, which are inspired from the mechanism by which chemicals interact and cross cell membranes. In this work, we consider a normal form of P systems with active membranes...
作者:Nicola Gigante , Angelo Montanari , Andrea Orlandini ...
来源:[J].Theoretical Computer Science(IF 0.489), 2020, Vol.815, pp.247-269
摘要:Abstract(#br)In timeline-based planning, domains are described as sets of independent, but interacting, components, whose behaviour over time (the set of timelines) is governed by a set of temporal constraints. A distinguishing feature of timeline-based planning systems is the ab...

我们正在为您处理中,这可能需要一些时间,请稍等。

资源合作:cnki.scholar@cnki.net, +86-10-82896619   意见反馈:scholar@cnki.net

×