1722 search results - page 295 / 345 » Ontology Formalism Transformation |
JUCS
2002
13 years 9 months ago
2002
: Design for All is an important challenge for hypermedia engineering. We analyze this challenge and show that it is necessary to find a way of describing partially designed hyperm...
ICRA
2010
IEEE
13 years 8 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
ISPDC
2010
IEEE
13 years 8 months ago
2010
IEEE
—This paper presents an operational semantics of the repetitive model of computation, which is the basis for the repetitive structure modeling (RSM) package defined in the stand...
PPDP
2010
Springer
13 years 8 months ago
2010
Springer
This paper connects the definitional interpreter for the λ-calculus extended with delimited continuation constructs, shift and reset, with a compiler and a low-level virtual mac...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...