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 38 Next

Displaying 741 – 760 of 4977

Showing per page

An orthogonality-based classification of conjectures in ortholattices.

Enric Trillas, Ana Pradera (2006)

Mathware and Soft Computing

A mathematical model for conjectures (including hypotheses, consequences and speculations), was recently introduced, in the context of ortholattices, by Trillas, Cubillo and Castiñeira (Artificial Intelligence 117, 2000, 255-257). The aim of the present paper is to further clarify the structure of this model by studying its relationships with one of the most important ortholattices' relation, the orthogonality relation. The particular case of orthomodular lattices -the framework for both Boolean...

An SMDP model for a multiclass multi-server queueing control problem considering conversion times

Zhicong Zhang, Na Li, Shuai Li, Xiaohui Yan, Jianwen Guo (2014)

RAIRO - Operations Research - Recherche Opérationnelle

We address a queueing control problem considering service times and conversion times following normal distributions. We formulate the multi-server queueing control problem by constructing a semi-Markov decision process (SMDP) model. The mechanism of state transitions is developed through mathematical derivation of the transition probabilities and transition times. We also study the property of the queueing control system and show that optimizing the objective function of the addressed queueing control...

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 Update on bdim the Italian Digital Mathematical Library

Zelati, Vittorio Coti (2011)

Towards a Digital Mathematics Library. Bertinoro, Italy, July 20-21st, 2011

bdim has been in operation since the fall of 2010 and has been slowly growing in the last year. I will report here: 1) on what is new in bdim with respect to the first presentation in DML 2010; 2) on some of the technical aspects of our implementation; 3) on the projects for the near future; 4) on some of the issues related to possible integration of bdim with EuDML.

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 .

Analogie - užitečná heuristická strategie

Petr Eisenmann, Jiří Přibyl (2016)

Učitel matematiky

This article describes a heuristic strategy of analogy and illustrates it by five school mathematics examples. These examples are efficiently solved while using such a strategy.

Analysis of a MX/G(a,b)/1 queueing system with vacation interruption

M. Haridass, R. Arumuganathan (2012)

RAIRO - Operations Research - Recherche Opérationnelle

In this paper, a batch arrival general bulk service queueing system with interrupted vacation (secondary job) is considered. At a service completion epoch, if the server finds at least ‘a’ customers waiting for service say ξ, he serves a batch of min (ξ, b) customers, where b ≥ a. On the other hand, if the queue length is at the most ‘a-1’, the server leaves for a secondary job (vacation) of random length. It is assumed that the secondary job is interrupted abruptly and the server resumes for primary...

Currently displaying 741 – 760 of 4977