Research on heuristic functions is all about estimating the length (or cost) of solution paths. But what if there is no such path? Many known heuristics have the ability to detect (some) unsolvable states, but that ability has always been treated as a by-product. No attempt has been made to design heuristics specifically for that purpose, where there is no need to preserve distances. As a case ...

A natural way to benefit from distribution is via asynchronous invocations to methods or services. Upon invocation, a request is enqueued at the destination side and the caller can continue its execution. But a question remains: “what if one wants to manipulate the result of an asynchronous invocation?” First-class futures provide a transparent and easy-to-program answer: a future acts as the p...

The paper presents the results of the author’s research in the domain system identification. The numerical algorithms developed by authors are presented, the algorithms used to identify the monovariable system by ordinal I and II. Meanwhile, the System Identification Toolbox was investigated as tool used to identify those systems. The numerical results ware compared, results obtain both by usin...

Using the symmetric form of the Lovász Local Lemma, one can conclude that a k-uniform hypergraph H admits a proper 2-colouring if the maximum degree (denoted by ∆) of H is at most 2 8k independently of the size of the hypergraph. However, this argument does not give us an algorithm to find a proper 2-colouring of such hypergraphs. We call a hypergraph linear if no two hyperedges have more than ...

Whenever a finitely generated group $G$ acts properly discontinuously by isometries on metric space $X$, there is an induced uniform embedding (a Lipschitz and uniformly proper map) $\rho: G \rightarrow X$ given mapping to orbit. We study when difference between acting contractible $n$-manifold into $n$-manifold. For example, Kapovich Kleiner showed that are torsion-free hyperbolic groups embed...