The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 41 –
60 of
411
We study cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 that are equipped with an external pushdown store. In this way we obtain an automata-theoretical characterization for the class of word languages that are linearizations of context-free trace languages.
We study cooperating distributed systems (CD-systems) of stateless deterministic
restarting automata with window size 1 that are equipped with an external pushdown store.
In this way we obtain an automata-theoretical characterization for the class of word
languages that are linearizations of context-free trace languages.
We describe CEDRICS, a general purpose system for automated journal production entirely based on a LaTeX input format. We show how the very basic ideas that initiated the whole effort turned into an efficient system because of the ability of LaTeX markup to parametrise simultaneously and without compromise high typographical quality for the PDF output as well as accurate XML metadata with (presentation) MathML formulas. This was made possible by the availability of two entirely independent LaTeX...
We investigate the density and distribution behaviors of the chinese remainder representation pseudorank. We give a very strong approximation to density, and derive two efficient algorithms to carry out an exact count (census) of the bad pseudorank integers. One of these algorithms has been implemented, giving results in excellent agreement with our density analysis out to -bit integers.
We investigate the density and distribution behaviors of the chinese remainder representation
pseudorank. We give a very strong approximation to density, and derive two efficient
algorithms to carry out an exact count (census) of the bad pseudorank integers. One of
these algorithms has been implemented, giving results in excellent agreement with
our density analysis out to 5189-bit integers.
This paper considers a variant of the bottleneck transportation problem. For each supply-demand point pair, the transportation time is an independent random variable. Preference of each route is attached. Our model has two criteria, namely: minimize the transportation time target subject to a chance constraint and maximize the minimal preference among the used routes. Since usually a transportation pattern optimizing two objectives simultaneously does not exist, we define non-domination in this...
This paper offers characteristic formula constructions in the
real-time logic Lν for several behavioural relations between
(states of) timed automata. The behavioural relations studied in
this work are timed (bi)similarity, timed ready simulation,
faster-than bisimilarity and timed trace inclusion. The
characteristic formulae delivered by our constructions have size
which is linear in that of the timed automaton they logically
describe. This also applies to the characteristic formula for...
Currently displaying 41 –
60 of
411