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

Page 1 Next

Displaying 1 – 20 of 65

Showing per page

Satisfiability and matchings in bipartite graphs: relationship and tractability.

Belaid Benhamou (2004)

RACSAM

Satisfiability problem is the task to establish either a given CNF logical formula admits a model or not. It is known to be the canonical NP-complete problem. We study in this note the relationship between matchings in bipartite graphs and the satisfiability problem, and prove that some restrictions of formulae including the known r-r-SAT1 class are trivially satisfiable. We present an algorithm which finds a model for such formulas in polynomial time complexity if one exists or, failing this, proves...

Scaling of model approximation errors and expected entropy distances

Guido F. Montúfar, Johannes Rauh (2014)

Kybernetika

We compute the expected value of the Kullback-Leibler divergence of various fundamental statistical models with respect to Dirichlet priors. For the uniform prior, the expected divergence of any model containing the uniform distribution is bounded by a constant 1 - γ . For the models that we consider this bound is approached as the cardinality of the sample space tends to infinity, if the model dimension remains relatively small. For Dirichlet priors with reasonable concentration parameters the expected...

Secuenciación dinámica de sistemas de fabricación flexible mediante aprendizaje automático: análisis de los principales sistemas de secuenciación existentes.

Paolo Priore, David de la Fuente, Javier Puente, Alberto Gómez (2001)

Qüestiió

Una forma habitual de secuenciar de modo dinámico los trabajos en los sistemas de fabricación es mediante el empleo de reglas de secuenciación. Sin embargo, el problema que presenta este método es que el comportamiento del sistema de fabricación dependerá de su estado, y no existe una regla que supere a las demás en todos los posibles estados que puede presentar el sistema de fabricación. Por lo tanto, sería interesante usar en cada momento la regla más adecuada. Para lograr este objetivo, se pueden...

Self-adaptation of parameters in a learning classifier system ensemble machine

Maciej Troć, Olgierd Unold (2010)

International Journal of Applied Mathematics and Computer Science

Self-adaptation is a key feature of evolutionary algorithms (EAs). Although EAs have been used successfully to solve a wide variety of problems, the performance of this technique depends heavily on the selection of the EA parameters. Moreover, the process of setting such parameters is considered a time-consuming task. Several research works have tried to deal with this problem; however, the construction of algorithms letting the parameters adapt themselves to the problem is a critical and open problem...

Semantics of MML Query

Grzegorz Bancerek (2012)

Formalized Mathematics

In the paper the semantics of MML Query queries is given. The formalization is done according to [4]

Semantics of MML Query - Ordering

Grzegorz Bancerek (2013)

Formalized Mathematics

Semantics of order directives of MML Query is presented. The formalization is done according to [1]

Sequent Calculus, Derivability, Provability. Gödel's Completeness Theorem

Marco Caminati (2011)

Formalized Mathematics

Fifth of a series of articles laying down the bases for classical first order model theory. This paper presents multiple themes: first it introduces sequents, rules and sets of rules for a first order language L as L-dependent types. Then defines derivability and provability according to a set of rules, and gives several technical lemmas binding all those concepts. Following that, it introduces a fixed set D of derivation rules, and proceeds to convert them to Mizar functorial cluster registrations...

Set arithmetic and the enclosing problem in dynamics

Marian Mrozek, Piotr Zgliczyński (2000)

Annales Polonici Mathematici

We study the enclosing problem for discrete and continuous dynamical systems in the context of computer assisted proofs. We review and compare the existing methods and emphasize the importance of developing a suitable set arithmetic for efficient algorithms solving the enclosing problem.

Several results on set-valued possibilistic distributions

Ivan Kramosil, Milan Daniel (2015)

Kybernetika

When proposing and processing uncertainty decision-making algorithms of various kinds and purposes, we more and more often meet probability distributions ascribing non-numerical uncertainty degrees to random events. The reason is that we have to process systems of uncertainties for which the classical conditions like σ -additivity or linear ordering of values are too restrictive to define sufficiently closely the nature of uncertainty we would like to specify and process. In cases of non-numerical...

Signature verification: A comprehensive study of the hidden signature method

Joanna Putz-Leszczyńska (2015)

International Journal of Applied Mathematics and Computer Science

Many handwritten signature verification algorithms have been developed in order to distinguish between genuine signatures and forgeries. An important group of these methods is based on dynamic time warping (DTW). Traditional use of DTW for signature verification consists in forming a misalignment score between the verified signature and a set of template signatures. The right selection of template signatures has a big impact on that verification. In this article, we describe our proposition for...

Currently displaying 1 – 20 of 65

Page 1 Next