Showing papers in "Theoretical Computer Science in 2015"

TL;DR: This work designs a new crossover-based genetic algorithm that uses mutation with a higher-than-usual mutation probability to increase the exploration speed and crossover with the parent to repair losses incurred by the more aggressive mutation.

TL;DR: A deterministic tracking algorithm based on a dynamic binary tree is proposed to track ?

TL;DR: An improved analysis of the Simple Genetic Algorithm for the OneMax problem overcomes some limitations and presents a technique to bound the diversity of the population that does not require a bound on its bandwidth.

TL;DR: The notion of robustness is extended to stochastic systems, and it is shown how to exploit this notion to address the system design problem, where the goal is to optimise some control parameters of a Stochastic model in order to maximise robustness of the desired specifications.

TL;DR: A proof system that enables us to refute quantified Boolean formulas (QBFs) and it is shown that ?

TL;DR: The results show that choosing the right size of the offspring population can be crucial and the speed-up from a larger λ reduces to sub-logarithmic (still at the price of a linear increase of the cost of each generation).

TL;DR: This paper first proposes an efficient and secure outsourcing algorithm for bilinear pairings in the two untrusted program model and utilizes this algorithm as a subroutine to achieve outsource-secure identity-based encryptions and signatures.

TL;DR: A simple linear-time algorithm constructing a context-free grammar of size O ( g log ?

TL;DR: The authors' algorithm for Chamberlin-Courant's rule can be modified to work for elections with bounded single-crossing width, and has considerably better worst-case running time than that of Betzler et al.

TL;DR: A new algorithm that computes the radius and the diameter of a weakly connected digraph G = ( V, E ) , by finding bounds through heuristics and improving them until they are validated, is proposed.

TL;DR: In this paper, an extension of the g-extra connectivity of an n-dimensional folded hypercube to all 0 ?

TL;DR: It is shown that a slightly adapted PSO almost surely finds a local optimum, and for a very general class of objective functions, results are provided about the quality of the solution found.

TL;DR: The algorithm ALBA is enhanced so as to guarantee its success on the class of recursive mu-inequalities, which is shown to coincide with the “Sahlqvist mu-formulas” defined in van Benthem, Bezhanishvili and Hodkinson [22].

TL;DR: It is proved that every such puzzle is solvable in O ( n 2 ) token swaps, and thus the problem of minimizing the number of token swaps to reach the target token placement can be solved exactly in polynomial time on complete bipartite graphs.

TL;DR: It is shown that the minimum number of agents required to solve the ANTS problem crucially depends on the computational capabilities of the agents as well as the timing parameters of the execution environment.

TL;DR: An almost matching lower bound for randomized leader election is presented, showing that ?

TL;DR: It is shown that the problem of conflict-free coloring of closed neighborhoods is NP-complete and that both problems become tractable if parameterized by the vertex cover number or the neighborhood diversity number of the graph.

TL;DR: This work considers several variations of the problems of covering a set of barriers using sensors that can detect any intruder crossing any of the barriers, and gives an O ( n 3 / 2 ) algorithm for a natural special case of this last problem.

TL;DR: This work proves NP-hardness results for five of Nintendo's largest video game franchises: Mario, Donkey Kong, Legend of Zelda, Metroid, and Pokemon.

TL;DR: The sliding token problem is known to be PSPACE-complete even for planar graphs, and also for bounded treewidth graphs as mentioned in this paper, and the decision problem is solvable in linear time.

TL;DR: It is shown that for any online algorithm with advice to be optimal, for any of the above scheduling problems, a non-constant number of bits of advice per request is needed.

TL;DR: This work defines bigraphs with sharing, which solves this problem by an extension of the basic formalism: the place graph is defined as a directed acyclic graph, thus allowing a natural representation of overlapping or intersecting locations.

TL;DR: The application of optimization algorithms to problems over discrete codomains corrupted by additive unbiased noise is considered by repeating the fitness evaluation of the noisy function sufficiently so that, with a fix probability, the function evaluation on the noisy case is identical to the true value.

TL;DR: It is shown that easy cases of oscillations can be tracked by a constant number of ants, but more involved oscillations that with overwhelming probability cannot be tracked with any polynomial-size colony are identified.

TL;DR: The m-binomial complexity of two classes of words: Sturmian words and (pure) morphic words that are fixed points of Parikh-constant morphisms like the Thue-Morse word is computed.

TL;DR: A simulation algorithm which, under quite general constraints, transforms algorithms running in the Congested Clique model into algorithmsRunning in the MapReduce model and highlights the similarities and differences between these models.

TL;DR: A generic framework where a weakest precondition semantics, in the form of indexed posets, is derived from a monad whose Kleisli category is enriched by posets.

TL;DR: A heuristic algorithm is derived which is capable of automatically curating the writing of ODE models in SBML, and some statistics obtained on the model repository biomodels.net are presented.

TL;DR: A distributed protocol based on the popular Label-Propagation approach is proposed and it is proved that, when the ratio p / q is larger than n b, the protocol finds the right "planted" partition in O ( log)?

TL;DR: This work gives the first complete necessary and sufficient condition for message adversaries that admits a Consensus algorithm and presents a new algorithm based upon reconstructing a partial, but significant, view of the actual communications that occurred during the evolution of the network.