Sciweavers

1650 search results - page 92 / 330
» The HOM problem is decidable
Sort
View
ICALP
2010
Springer
14 years 4 days ago
B and D Are Enough to Make the Halpern-Shoham Logic Undecidable
Abstract. The HalpernShoham logic is a modal logic of time intervals. Some eort has been put in last ten years to classify fragments of this beautiful logic with respect to decid...
Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel Kie...
CORR
2010
Springer
106views Education» more  CORR 2010»
13 years 10 months ago
Scheduling in Parallel Queues with Randomly Varying Connectivity and Switchover Delay
We consider a dynamic server control problem for two parallel queues with randomly varying connectivity and server switchover time between the queues. At each time slot the server...
Guner D. Celik, Long Bao Le, Eytan Modiano
ALGORITHMICA
2006
103views more  ALGORITHMICA 2006»
13 years 10 months ago
Recognizing Hole-Free 4-Map Graphs in Cubic Time
We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at mo...
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. P...
ENTCS
2006
103views more  ENTCS 2006»
13 years 10 months ago
A Taxonomy of Model Transformation
This report summarises the results of the discussions of a working group on model transformation of the Dagstuhl Seminar on Language Engineering for Model-Driven Software Developme...
Tom Mens, Pieter Van Gorp
FUIN
2006
63views more  FUIN 2006»
13 years 10 months ago
Interpreted Trajectories
Abstract. We introduce generalized trajectories where the individual symbols are interpreted as operations performed on the operand words. The various previously considered traject...
Michael Domaratzki, Grzegorz Rozenberg, Kai Saloma...