Sciweavers

Share
CSR
2010
Springer
10 years 4 months ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
Uwe Schöning
CSR
2010
Springer
10 years 4 months ago
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
Pawel Gawrychowski, Artur Jez, Lukasz Jez
CSR
2010
Springer
10 years 4 months ago
Balancing Bounded Treewidth Circuits
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
Maurice Jansen, Jayalal M. N. Sarma
CSR
2010
Springer
10 years 4 months ago
Realizability of Dynamic MSC Languages
Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can ...
Benedikt Bollig, Loïc Hélouët
CSR
2010
Springer
10 years 4 months ago
Prehistoric Phenomena and Self-referentiality
By terms-allowed-in-types capacity, the Logic of Proofs LP includes formulas of the form t : ϕ(t), which have self-referential meanings. In this paper, “prehistoric phenomena...
Junhua Yu
books