Buscar
Mostrando ítems 1-7 de 7
Artículo
Generating non-conspiratorial executions
(Elsevier, 2007)
Avoiding conspiratorial executions is useful for debugging, model checking or refinement, and helps implement several wellknown problems in faulty environments; furthermore, avoiding non-equivalence robust executions ...
Ponencia
Sincronización multiproceso en programas concurrentes: selección completamente k-justa de interacciones
(Universidad de Castilla-La Mancha, 2001-11)
La selección complemente justa surge en el contexto de los programas no deterministas y sirve para garantizar que todos los elementos que se habilitan infinitamente a menudo se seleccionan infinitamente a menudo. Esta ...
Artículo
Wrapping Web Data Islands
(Graz University of Technology, 2008)
Ponencia
An Algorithm for Ensuring Fairness and Liveness in Non-deterministic Systems Based on Multiparty Interactions
(Springer, 2002)
Strong fairness is a notion we can use to ensure that an element that is enabled infinitely often in a non–deterministic programme, will eventually be selected for execution so that it can progress. Unfortunately, “eventually” ...
Artículo
From Wrapping to Knowledge
(IEEE Computer Society, 2007)
One the most challenging problems for Enterprise Information Integration is to deal with heterogeneous information sources on the Web. The reason is that they usually provide information that is in human-readable form ...
Ponencia
Knowledge Channels: Bringing the Knowledge on the Web to Software Agents
(CEUR-WS, 2003)
In this paper, we present a new framework to extract knowledge from today’s non-semantic web. It associates semantics with the information extracted, which improves agent interoperability; it can also deal with changes ...
Ponencia
Coping with Web Knowledge
(Springer, 2003)
The web seems to be the biggest existing information repository. The extraction of information from this repository has attracted the interest of many researchers, who have developed intelligent algorithms (wrappers) ...