1523 search results - page 124 / 305 » Partially ordered secretaries |
151
click to vote
SLP
1994
15 years 6 months ago
1994
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...
155
click to vote
IJRR
2008
15 years 5 months ago
2008
Robots must complete their tasks in spite of unreliable actuators and limited, noisy sensing. In this paper, we consider the information requirements of such tasks. What sensing a...
113
click to vote
ENTCS
2007
15 years 5 months ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
135
click to vote
FUIN
2007
15 years 5 months ago
2007
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
137
click to vote
ALIFE
2005
15 years 5 months ago
2005
We present a novel formal interpretation of dynamical hierarchies based on information theory, in which each level is a near-state-determined system, and levels are related to one ...