María Isabel Alfonso Galipienso- University of Alicante
María Isabel Alfonso Galipienso
- University of Alicante
About
11
Publications
1,395
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
21
Citations
Introduction
Current institution
Publications
Publications (11)
Acknowledgements For the elaboration of this document we have used material from past team members, be them from the original TeamSweden or its follow-up TeamChaos. The list is becoming rather large, so we strongly thank all of them for their contributions and effort, which has allow us to continue with the work. In particular, this document is bas...
Scheduling problems can be viewed as a set of temporal metric and disjunctive constraints and so they can be formulated in terms of CSP techniques. In the literature, there are CSP-based methods which sequentially interleave search efforts with the application of consistency enforcing mechanisms and variable/ordering heuristics. Therefore, the numb...
The purpose of this paper is to show the expressiveness provided by the use of a Labelled TCSP model in order to specify and reason about disjunc- tive temporal constraints. We use a network based representation. The rea- soning algorithms allows us to manage complex temporal constraints, both in assertion and query processes. It allows disjunctive...
Scheduling problems can be seen as a set of temporal metric and dis- junctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-based methods which interleave (sequentially) searching efforts with the application of consistency enforcing mechanisms and variable/value ordering heuristics. Alternati...
El problema de scheduling ha sido estudiado bajo diferentes aproximaciones, fundamentalmente mediante técnicas CSP. En este artículo se presenta un método que combina el proceso de clausura de restricciones con el proceso CSP. Inicialmente, modelamos el scheduling como el problema de satisfacer y encontrar la solución de un conjunto de restriccione...
El problema de scheduling ha sido estudiado bajo diferentes aproximaciones, fundamentalmente mediante técnicas CSP. En este artículo se presenta un método que combina el proceso de clausura de restricciones con el proceso CSP. Inicialmente, modelamos el scheduling como el problema de satisfacer y encontrar la solución de un conjunto de restriccione...
Proyecto subvencionado por la Comunidad Europea en el programa ESPRIT-II (BRA), número de acción 3279.
We first studied the uptake and excretion of the dye BSP by the isolated and perfused rat liver and by the rat liver in vivo. We then studied BSP-glutathion conjugation with these same methods. We found that benziodarone which induces a marked decrease of conjugation is able to inhibit in vitro the combination BSP-glutathion.
