نتایج جستجو برای: minimisation

تعداد نتایج: 2538  

Journal: :Environment. Technology. Resources. Proceedings of the International Scientific and Practical Conference 2006

2010
Sven Schewe

In this paper we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular languages, and deterministic Büchi, Co-Büchi, and parity automata play a similar role in the recognition of ω-regular languages. While it is well known that the minimisation of deterministic finite and weak automata i...

Journal: :Technologie et innovation = 2023

L'article analyse le principe de minimisation des données ou nécessité énoncé, d'une part, dans Règlement général sur la protection (RGPD), en Europe, et, d'autre (...)

Journal: :Mathematical Structures in Computer Science 2004
Robert D. Rosebrugh Nicoletta Sabadini Robert F. C. Walters

The context of this article is the program to study the bicategory of spans of graphs as an algebra of processes, with applications to concurrency theory. The objective here is to study functorial aspects of reachability, minimization and minimal realization. The compositionality of minimization has application to model-checking.

2008
Jilles Vreeken Arno Siebes

Many data sets are incomplete. For correct analysis of such data, one can either use algorithms that are designed to handle missing data or use imputation. Imputation has the benefit that it allows for any type of data analysis. Obviously, this can only lead to proper conclusions if the provided data completion is both highly accurate and maintains all statistics of the original data.1 In this ...

Journal: :Electronic Notes in Discrete Mathematics 2005
Hongmei He Ondrej Sýkora Imrich Vrto

The minimisation of edge crossings in a book drawing of a graph G is one of important goals for a linear VLSI design, and the two-page crossing number of a graph G provides an upper bound for the standard planar crossing number. We propose several new heuristics for the 2-page drawing problem and test them on benchmark test sets like Rome graphs, Random Connected Graphs and some typical graphs....

2003
Ana Respicio Maria Eugénia Captivo

In our cooperation with a Portuguese paper producer, Respicio et al. (2002), we identified two major sequencing objectives: (1) the minimisation of the maximum number of open stacks and (2) the minimisation of the average order spread. The space around the cutting saw is narrow. As the number of produced items increase, packing mistakes arise. Objective (1) concerns the minimisation of these mi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید