1650 search results - page 270 / 330 » The HOM problem is decidable |
FMSD
2006
13 years 10 months ago
2006
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
CE
2007
13 years 10 months ago
2007
Increased flexibility and modularisation in higher education complicates the process of learners finding their way through the offerings of higher education institutions. In lifel...
JAL
2008
13 years 10 months ago
2008
Biological systems are far more complex and robust than systems we can engineer today. One way to increase the complexity and robustness of our engineered systems is to study how ...
JGT
2008
13 years 10 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
JAIR
2006
13 years 10 months ago
2006
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...