Sciweavers

620 search results - page 61 / 124
» Algorithms and computations on cellular automata
Sort
View
108
Voted
CADE
2008
Springer
16 years 27 days ago
Automata-Based Axiom Pinpointing
Axiom pinpointing has been introduced in description logics (DL) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base th...
Franz Baader, Rafael Peñaloza
WOLLIC
2009
Springer
15 years 7 months ago
Property Driven Three-Valued Model Checking on Hybrid Automata
Abstract. In this paper, we present a three-valued property driven model checking algorithm for the logic CTL on hybrid automata. The technique of multivalued model checking for hy...
Kerstin Bauer, Raffaella Gentilini, Klaus Schneide...
FORMATS
2003
Springer
15 years 5 months ago
Folk Theorems on the Determinization and Minimization of Timed Automata
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
Stavros Tripakis
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
15 years 7 months ago
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002
96
Voted
ITICSE
2004
ACM
15 years 6 months ago
Generation as method for explorative learning in computer science education
The use of generic and generative methods for the development and application of interactive educational software is a relatively unexplored area in industry and education. Advant...
Andreas Kerren