1650 search results - page 34 / 330 » The HOM problem is decidable |
TIME
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we consider quantitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion. These constraint networks are...
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a ...
DLOG
2004
13 years 9 months ago
2004
Recently, it was shown for the DL EL that subsumption and instance problem w.r.t. cyclic terminologies can be decided in polynomial time. In this paper, we show that both problems...
EOR
2008
13 years 7 months ago
2008
We study a problem faced by a major beverage producer. The company produces and distributes several brands to various customers from its regional distributors. For some of these b...
TCS
2008
13 years 7 months ago
2008
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...