Sciweavers

1557 search results - page 212 / 312
» Programming up to Congruence
Sort
View
EPIA
2007
Springer
15 years 5 months ago
Towards Tractable Local Closed World Reasoning for the Semantic Web
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
Matthias Knorr, José Júlio Alferes, ...
FROCOS
2007
Springer
15 years 5 months ago
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
Beatriz Alarcón, Salvador Lucas
GCC
2007
Springer
15 years 5 months ago
Improving the Performance of MPI Applications over Computational Grid
The Message Passing Interface (MPI) is a standard in parallel computing, and can also be used as a highperformance programming model for Grid application development. How to execu...
Bo Song, Guangwen Yang, Qiming Fang
GECCO
2007
Springer
175views Optimization» more  GECCO 2007»
15 years 5 months ago
On the constructiveness of context-aware crossover
Crossover in Genetic Programming is mostly a destructive operator, generally producing children worse than the parents and occasionally producing those who are better. A recently ...
Hammad Majeed, Conor Ryan
ICALP
2007
Springer
15 years 5 months ago
Approximation by DNF: Examples and Counterexamples
Say that f : {0, 1}n → {0, 1} -approximates g : {0, 1}n → {0, 1} if the functions disagree on at most an fraction of points. This paper contains two results about approximatio...
Ryan O'Donnell, Karl Wimmer