Sciweavers

2905 search results - page 236 / 581
» Formal Memetic Algorithms
Sort
View
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 8 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
DAARC
2007
Springer
137views Algorithms» more  DAARC 2007»
14 years 5 months ago
Anaphora Resolution as Equality by Default
The resolution of anaphora is dependent on a number of factors discussed in the literature: syntactic parallelism, topicality, etc. A system that attempts to resolve anaphora will ...
Ariel Cohen
ASIAN
2003
Springer
111views Algorithms» more  ASIAN 2003»
14 years 4 months ago
Unreliable Failure Detectors via Operational Semantics
Abstract. The concept of unreliable failure detectors for reliable distributed systems was introduced by Chandra and Toueg as a fine-grained means to add weak forms of synchrony i...
Uwe Nestmann, Rachele Fuzzati
SEMWEB
2009
Springer
14 years 3 months ago
Semantic Web Service Composition in Social Environments
This paper describes how to generate compositions of semantic Web services using social trust information from user ratings of the services. We present a taxonomy of features, suc...
Ugur Kuter, Jennifer Golbeck
AI
2010
Springer
13 years 11 months ago
Logic-based ontology comparison and module extraction, with an application to DL-Lite
We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of `lightweight' description...
Roman Kontchakov, Frank Wolter, Michael Zakharyasc...