نتایج جستجو برای: temporal directed tree
تعداد نتایج: 558799 فیلتر نتایج به سال:
Parse::Eyapp (Extended yapp) is a collection of modules that extends Francois Desarmenien Parse::Yapp 1.05. Eyapp extends yacc/yapp syntax with functionalities like named attributes, EBNF-like expressions, modifiable default action, automatic syntax tree building, semi-automatic abstract syntax tree building, translation schemes, tree regular expressions, tree transformations, scope analysis su...
We identify the class of directed one-trees and prove the so-called min-max theorem for them. As a consequence, we establish the equality of directed tree-width and a new measure, d-width, on this class of graphs. In addition, we prove a property of all directed one-trees and use this property to create an O(n) recognition algorithm and an O(n) algorithm for solving the Hamiltonian cycle proble...
Tree-width is a well-known metric on undirected graphs that measures how tree-like a graph is and gives a notion of graph decomposition that proves useful in algorithm design. Treewidth can be characterised by a graph searching game where a number of cops attempt to capture a robber. We consider the natural adaptation of this game to directed graphs and show that monotone strategies in the game...
The real transactional databases often exhibit temporal characteristic and time varying behavior. Temporal association rule has thus become an active area of research.A calendar unit such as months and days, clock units such as hours and seconds and specialized units such as business days and academic years, play a major role in a wide range of information system applications. The calendar-base...
We introduce an automata-theoretic approach for the verification of multi-agent systems. We present a translation between branching time temporal-epistemic logic and alternating tree automata. Model checking an interpreted system against a temporal-epistemic formula is reduced to checking the non-emptiness of the composition of two tree automata. We exemplify this technique using a simple multi...
Urban heat islands (UHIs) created through urbanization can have negative impacts on the lives of people living in cities. They may also vary spatially and temporally over a city. There is, thus, a need for greater understanding of these patterns and their causes. While previous UHI studies focused on only a few cities and/or several explanatory variables, this research provides a comprehensive ...
We survey a number of decidablity and undecidablity results concerning epistemic temporal logic. The goal is to provide a general picture which will facilitate the ‘sharing of ideas’ from a number of different areas concerned with modeling agents in interactive social situations.
In this paper we present a temporal planning approach for handling problems with deadlines. The model relies on the extraction of temporal landmarks from the problem and the construction of a landmarks graph as a skeleton of the solution plan. A temporal landmark is a proposition that must be achieved in a solution plan to satisfy the problem deadline constraints. Each temporal landmark is asso...
We study the capacity of point-to-point erasure networks under a restricted form of network coding to which we refer as spatial network coding. In this form of coding, the nodes can not perform coding on successive packets which are received from one incoming link. The coding at a node is restricted to the packets received at the same time slot from different incoming links...
We examine temporal joins in the presence of indexing schemes. Utilizing an index when processing join queries is especially advantageous if the join predicates involve only a portion of the temporal relations. This is a novel problem since temporal indices have various characteristics that can affect join processing drastically. For example, temporal indices commonly introduce record copies to...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید