Sciweavers

3663 search results - page 29 / 733
» Problems in the ontology of computer programs
Sort
View
CP
2005
Springer
14 years 2 months ago
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
Grégoire Dooms, Yves Deville, Pierre Dupont
ICDCS
2003
IEEE
14 years 1 months ago
Software Fault Tolerance of Distributed Programs Using Computation Slicing
Writing correct distributed programs is hard. In spite of extensive testing and debugging, software faults persist even in commercial grade software. Many distributed systems, esp...
Neeraj Mittal, Vijay K. Garg
ERSHOV
2006
Springer
14 years 9 days ago
Program Generation in the Equivalent Transformation Computation Model Using the Squeeze Method
In the equivalent transformation (ET) computation model, a specification provides background knowledge in a problem domain, a program is a set of prioritized rewriting rules, and c...
Kiyoshi Akama, Ekawit Nantajeewarawat, Hidekatsu K...
EUROGP
2001
Springer
103views Optimization» more  EUROGP 2001»
14 years 1 months ago
Computational Complexity, Genetic Programming, and Implications
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
Bart Rylander, Terence Soule, James A. Foster
ESWS
2006
Springer
14 years 9 days ago
Toward Multi-viewpoint Reasoning with OWL Ontologies
Abstract. Despite of their advertisement as task independent representations, the reuse of ontologies in different contexts is difficult. An explanation for this is that when devel...
Heiner Stuckenschmidt