In the (zero-sum) search game (G; x) proposed by Isaacs, the Hider picks a point H in the network G and the Searcher picks a unit speed path S (t) in G with S (0) = x: The payo¤ to the maximizing Hider is the time T = T (S;H) = min ft : S (t) = Hg required for the Searcher to …nd the Hider. An extensive theory of such games has been developed in the literature. This paper considers the related ...

The Chinese Postman Problem in a graph is the problem of finding a shortest closed walk traversing all the edges. In a (2r + 1)-regular graph, the problem is equivalent to finding a smallest spanning subgraph in which all vertices have odd degree. We establish a sharp upper bound for the solution in 3-regular graphs, characterize when equality holds, and conjecture the answer for general r.

Important layout properties of electronic designs include space requirements and interconnection lengths. A reliable interconnection length estimation is essential for improving placement and routing techniques. Donath found an upper bound for the average interconnection length that follows the trends of experimentally obtained average lengths [2]. Yet, this upper bound deviates from the experi...

We describe the development of a constraint logic programming based system, called CPP, which is capable of generating most preferred plans with respect to a user’s preference and evaluate its performance.

Important layout properties of electronic circuits include space requirements and interconnection lengths. In the process of designing these circuits, a reliable pre-layout interconnection length estimation is essential for improving placement and routing techniques. Donath found an upper bound for the average interconnection length that follows the trends of experimentally observed average len...

We consider finding discrete logarithms in a group G when the help of an algorithm D that distinguishes certain subsets of G from each other is available. For a group G of prime order p, if algorithm D is polynomialtime with complexity c(log(p)), we can find discrete logarithms faster than square-root algorithms. We consider two variations on this idea and give algorithms solving the discrete l...

Motivated by the success of the translation-based approach for conformant planning, introduced by Palacios and Geffner, we present two variants of a new compilation scheme from conformant probabilistic planning problems (CPP) to variants of classical planning. In CPP, we are given a set of actions – which we assume to be deterministic in this paper, a distribution over initial states, a goal co...

Planning is traditionally associated with the search for sequences of actions spread over time. In this paper we present a component placement problem (CPP), which is concerned with sequences of actions spread in the space of wide-area networks. We argue that, despite the lack of a time component, the CPP is a planning problem. We discuss complexity of the CPP and similarities between the CPP a...

The zero-sum distinguishers introduced by Aumasson and Meier are investigated. First, the minimal size of a zero-sum is established. Then, we analyze the impacts of the linear and the nonlinear layers in an iterated permutation on the construction of zero-sum partitions. Finally, these techniques are applied to the Keccak-f permutation and to Hamsi-256. We exhibit several zero-sum partitions fo...