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 24

Showing per page

Tamaño medio de árboles simplificados.

María Inés Fernández Camacho (1987)

Qüestiió

Estudiamos la media y la varianza del tamaño de los árboles simplificados obtenidos a partir de árboles p-arios y generales. Se demuestra que ambos parámetros son lineales en el tamaño del input. Pero lo que creemos más interesante del artículo es la metodología seguida, que pensamos podría aplicarse al análisis de gran parte de algoritmos de simplificación sobre árboles. Tal técnica involucra un estudio de ciertas series de potencias formales, y la aplicación del teorema de Darboux-Polya para aproximaciones...

The application of generalised constraints to object-oriented database models.

Guy de Tré, Rita de Caluwe (2000)

Mathware and Soft Computing

A formal framework for a generalised object-oriented database model is presented, which is able to cope with fuzzy and uncertain information. This model is obtained as a generalisation of a crisp object-oriented database model, which is consistent with the ODMG de facto standard and is built upon an algebraic type system and a constraint system. Generalised constraints have been used to enforce integrity rules and to specify the formal semantics of the database model.

The complexity of lexicographic sorting and searching

Juraj Wiedermann (1981)

Aplikace matematiky

An asymptotically optimal sorting algorithm that uses Θ ( n ( l o g n + k ) ) component comparisons to lexicographically sort the set of n k -tuples is presented. This sorting algorithm builds the static data structure - the so called optimal lexicographic search tree - in which it is possible to perform member searching for an unknown k -tuple in at most [ ( l o g 2 ( n + 1 ) ] + k - 1 comparisons. The number of comparisons...

The Diamond Tool: a way of effective development and utilization of knowledge

Zdenko Staníček, Filip Procházka (2004)

Kybernetika

This paper presents the Diamond Tool for knowledge management. The main objective of its specification and implementation was to create a universal and easily extendable tool for efficient work with knowledge. One of its extensions is the eTrium technology. The principal idea behind this technology is to represent explicitly the knowledge used by the information system by means of a knowledge agent built on the Diamond Tool – in contrary to current approaches, where knowledge is present implicitly...

The factor automaton

Milan Šimánek (2002)

Kybernetika

This paper concerns searching substrings in a string using the factor automaton. The factor automaton is a deterministic finite automaton constructed to accept every substring of the given string. Nondeterministic factor automaton is used to achieve new operations on factor automata for searching in non-constant texts.

The sum-product algorithm: algebraic independence and computational aspects

Francesco M. Malvestuto (2013)

Kybernetika

The sum-product algorithm is a well-known procedure for marginalizing an “acyclic” product function whose range is the ground set of a commutative semiring. The algorithm is general enough to include as special cases several classical algorithms developed in information theory and probability theory. We present four results. First, using the sum-product algorithm we show that the variable sets involved in an acyclic factorization satisfy a relation that is a natural generalization of probability-theoretic...

The use of fuzzy connectives to design real-coded genetic algorithms.

Francisco Herrera, Manuel Lozano, José Luis Verdegay (1994)

Mathware and Soft Computing

Genetic algorithms are adaptive methods that use principles inspired by natural population genetics to evolve solutions to search and optimization problems. Genetic algorithms process a population of search space solutions with three operations: selection, crossover and mutation. A great problem in the use of genetic algorithms is premature convergence; the search becomes trapped in a local optimum before the global optimum is found. Fuzzy logic techniques may be used for solving this problem. This...

The Value of Knowing that You Do Not Know

Greenstein, Gil, Ahituv, Niv (2009)

Serdica Journal of Computing

The value of knowing about data availability and system accessibility is analyzed through theoretical models of Information Economics. When a user places an inquiry for information, it is important for the user to learn whether the system is not accessible or the data is not available, rather than not have any response. In reality, various outcomes can be provided by the system: nothing will be displayed to the user (e.g., a traffic light that does not operate, a browser that keeps browsing, a telephone...

Currently displaying 1 – 20 of 24

Page 1 Next