All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

57 806 (0,197s)

Result

Parallel simulation algorithm for maintenance optimization based on directed Acyclic Graph

on Monte Carlo method. A directed Acyclic Graph is used as a useful system subjected to the corresponding part of the Acyclic Graph. The parts of the Acyclic Graph processes applied on t...

BB - Aplikovaná statistika, operační výzkum

  • 2008
  • Jx
Result

Directed Acyclic Subsequence Graph

JC - Počítačový hardware a software

  • 1998
  • X
Result

Implementation of Directed Acyclic Word Graph

Not available...

JC - Počítačový hardware a software

  • 2002
  • Jx
Result

Algorithms for transitive closure

A new algorithm for a construction of the transitive closure of directed acyclic graphs is suggested. An analysis of computation of the transitive closure of directed graphs is presented......

BA - Obecná matematika

  • 2002
  • Jx
Result

Implementation of the "Compact acyclical Word Directed Graphs (CDAWG)" for quick search for DNA subsequences.

This library implements the "Compact Directed acyclical Word Graph" hereinafter CDAWG, which is a compact data structure built on the principle of finite automata. The aim of the library implementation is the possibility of...

IN - Informatika

  • 2015
  • R
  • Link
Result

Serialization of Transactions: A Graph-Theoretic Approach

We have shown that the function, which maps each schedule of transaction to its serialization graph, is a surjection but it is not an injection. Using the probabilistic argument, we have shown that almost all directed graphs

IN - Informatika

  • 2006
  • D
Result

Directed elimination games

on undirected graphs, corresponding width measures for directed graphs have not yet fulfilled their promise for broad algorithmic applications on directed graphs. One reason for this is that in most exist...

IN - Informatika

  • 2016
  • Jx
  • Link
Result

On the acyclic polynomial of the linear chain of hexagons

of this polynomial. The acyclic polynomial of a graph is a special kind of the matching Gutman provided the mathematical principle of the acyclic polynomial of a graph. Two decomposition formula is used for calcul...

BA - Obecná matematika

  • 2015
  • D
Result

DAG-width - Connectivity Measure for Directed Graphs

Tree-width is a very useful connectivity measure for undirected graphs. We propose a new definition, called DAG-width, for directed graphs which measures how close a graph is to a directed acyclic...

BA - Obecná matematika

  • 2006
  • D
Result

Direct unavailability computation of a maintained highly reliable system

The paper presents a new analytical algorithm which is able to carry out exact reliability quantification of highly reliable systems with maintenance (both preventive and corrective). A directed acyclic graph is used as a s...

BB - Aplikovaná statistika, operační výzkum

  • 2010
  • Jx
  • 1 - 10 out of 57 806