1650 search results - page 13 / 330 » The HOM problem is decidable |
152
Voted
LFCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” whic...
123
click to vote
AIIDE
2007
15 years 6 months ago
2007
AI techniques are already widely used in game software to provide computer-controlled opponents for human players. However, game design is a more-challenging problem than game pla...
107
click to vote
TAMC
2007
Springer
15 years 10 months ago
2007
Springer
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
140
click to vote
CCS
2005
ACM
15 years 9 months ago
2005
ACM
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
138
click to vote
HYBRID
1995
Springer
15 years 7 months ago
1995
Springer
Abstract. In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state spa...