All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 14 Next

Displaying 261 – 280 of 2186

Showing per page

An Oriented Version of the 1-2-3 Conjecture

Olivier Baudon, Julien Bensmail, Éric Sopena (2015)

Discussiones Mathematicae Graph Theory

The well-known 1-2-3 Conjecture addressed by Karoński, Luczak and Thomason asks whether the edges of every undirected graph G with no isolated edge can be assigned weights from {1, 2, 3} so that the sum of incident weights at each vertex yields a proper vertex-colouring of G. In this work, we consider a similar problem for oriented graphs. We show that the arcs of every oriented graph −G⃗ can be assigned weights from {1, 2, 3} so that every two adjacent vertices of −G⃗ receive distinct sums of outgoing...

An specification language for fuzzy systems.

Francisco José Moreno-Velo, Santiago Sánchez-Solano, Angel Barriga, M.ª Iluminada Baturone, Diego R. López (2001)

Mathware and Soft Computing

This work presents the main features of XFL3, a language for fuzzy system specification, which has been defined as the common description languaje for the tools forming the Xfuzzy 3.0 development environment. Its main advantages are its capability to admit user-defined membership functions, parametric operators, and linguistic hedges. A brief summary of the tools included in Xfuzzy 3.0 and an example illustrating the use of XFL3 are also included.

An upper bound for transforming self-verifying automata into deterministic ones

Ira Assent, Sebastian Seibert (2007)

RAIRO - Theoretical Informatics and Applications

This paper describes a modification of the power set construction for the transformation of self-verifying nondeterministic finite automata to deterministic ones. Using a set counting argument, the upper bound for this transformation can be lowered from 2 n to O ( 2 n n ) .

An upper bound on the space complexity of random formulae in resolution

Michele Zito (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We prove that, with high probability, the space complexity of refuting a random unsatisfiable Boolean formula in k -CNF on n variables and m = Δ n clauses is O n · Δ - 1 k - 2 .

Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view

Luis M. Torres, Annegret K. Wagler (2013)

RAIRO - Operations Research - Recherche Opérationnelle

To model the dynamics of discrete deterministic systems, we extend the Petri nets framework by a priority relation between conflicting transitions, which is encoded by orienting the edges of a transition conflict graph. The aim of this paper is to gain some insight into the structure of this conflict graph and to characterize a class of suitable orientations by an analysis in the context of hypergraph theory.

Antiassociative groupoids

Milton Braitt, David Hobby, Donald Silberger (2017)

Mathematica Bohemica

Given a groupoid 〈 G , ☆ 〉 , and k ≥ 3 , we say that G is antiassociative if an only if for all x 1 , x 2 , x 3 ∈ G , ( x 1 ☆ x 2 ) ☆ x 3 and x 1 ☆ ( x 2 ☆ x 3 ) are never equal. Generalizing this, 〈 G , ☆ 〉 is k -antiassociative if and only if for all x 1 , x 2 , ... , x k ∈ G , any two distinct expressions made by putting parentheses in x 1 ☆ x 2 ☆ x 3 ☆ ⋯ ☆ x k are never equal. We prove that for every k ≥ 3 , there exist finite groupoids that are k -antiassociative. We then generalize this, investigating when other pairs of groupoid terms can be made never equal.

Currently displaying 261 – 280 of 2186