Abstract I defend an iterated knowledge condition on responsibility for outcomes: one is responsible a consequence of one's action only if was in position to know that, all know, would have that consequence.

We prove that an iterated torus knot type fails the uniform thickness property (UTP) if and only if all of its iterations are positive cablings, which is precisely when an iterated torus knot type supports the standard contact structure. We also show that all iterated torus knots that fail the UTP support cabling knot types that are transversally non-simple.

In combinatorial solution spaces Iterated Local Search turned out to be exceptionally successful. The question arises: is the Iterated Local Search heuristic also able to improve the optimization process in real-valued solution spaces? This paper introduces a hybrid meta-heuristic based on Iterated Local Search and Powell’s optimization method combined with elements from stochastic search in re...

In this paper, we give a theoretically founded transition from Iterated Function Systems based on aane transformations to Partitioned Iterated Function Systems. We show that there are two essential steps, namely, restricting the aane transformations, and solving the evoked problem of ink dissipation. In this paper, we give a theoretically founded transition from Iterated Function Systems based ...

This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...

The iterated di erence of polyhedra V P n P n Pk has been proposed independently in and as a su cient condition for V to be exactly computable by a two layered neural network An algorithm checking whether V IR is an iterated di erence of polyhedra is proposed in However this algorithm is not practically usable because it has a high computational complexity and it was only conjectured to stop wi...

Inference for partially observed Markov process models has been a longstanding methodological challenge with many scientific and engineering applications. Iterated filtering algorithms maximize the likelihood function for partially observed Markov process models by solving a recursive sequence of filtering problems. We present new theoretical results pertaining to the convergence of iterated fi...

We consider here two formal operations on words inspired by the DNA biochemistry: hairpin lengthening introduced in [10] and its inverse called hairpin shortening. We study the closure of the class of regular languages under the non-iterated and iterated variants of the two operations. The main results are: although any finite number of applications of the hairpin lengthening to a regular langu...

The field of iterated belief change has focused mainly on revision, with the other main operator of AGM belief change theory, i.e., contraction receiving relatively little attention. In this paper we extend the Harper Identity from single-step change to define iterated contraction in terms of iterated revision. Specifically, just as the Harper Identity provides a recipe for defining the belief ...

in this paper we define weak $f$-contractions on a‎ ‎metric space into itself by extending $f$-contractions‎ ‎introduced by d‎. ‎wardowski (2012) and provide some fixed point‎ ‎results in complete metric spaces and in partially ordered complete ‎generalized metric spaces‎. ‎some relationships between weak‎ ‎$f$-contractions and $fi$-contractions are highlighted‎. ‎we also ‎give some application...