The paper describes a transition logic, TL, and a deductive formalism for it. It shows how various important aspects (such as ramification, qualification, specificity, simultaneit...
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
In this paper, we study a bidding problem which can be modeled as a set packing problem. A simulated annealing heuristic with three local moves, including an embedded branch-and-b...
In the domain of embedded software systems the increasing complexity of the functionality as well as the increase in variations caused by product lines requires a modular design p...
f of the underlying abstract theorem avoids of referring to any results of applied algebraic topology and relies only on the Brouwer fixed point theorem. The second novelty is tha...