Results 271 to 280 of about 69,786 (317)
Some of the next articles are maybe not open access.
Best Practice & Research Clinical Obstetrics & Gynaecology, 2023
Expectant management of a cesarean scar pregnancy (CSP) is associated with a high risk of severe maternal morbidity. Therefore, most experts recommend immediate termination after the diagnosis of a CSP. However, there is no consensus about the optimal management of a CSP in terms of efficacy, safety, and preservation of future fertility.
NOEL, Laure, Chantraine, Frédéric
openaire +2 more sources
Expectant management of a cesarean scar pregnancy (CSP) is associated with a high risk of severe maternal morbidity. Therefore, most experts recommend immediate termination after the diagnosis of a CSP. However, there is no consensus about the optimal management of a CSP in terms of efficacy, safety, and preservation of future fertility.
NOEL, Laure, Chantraine, Frédéric
openaire +2 more sources
Proceedings of the forty-second ACM symposium on Theory of computing, 2010
Bulatov (2008) has given a dichotomy for the counting constraint satisfaction problem, #CSP. A problem from #CSP is characterized by a constraint language γ, which is a fixed, finite set of relations over a finite domain. An instance of the problem uses these relations to constrain the values taken by a finite set of variables. Bulatov showed that, for
Martin E. Dyer, David Richerby
openaire +1 more source
Bulatov (2008) has given a dichotomy for the counting constraint satisfaction problem, #CSP. A problem from #CSP is characterized by a constraint language γ, which is a fixed, finite set of relations over a finite domain. An instance of the problem uses these relations to constrain the values taken by a finite set of variables. Bulatov showed that, for
Martin E. Dyer, David Richerby
openaire +1 more source
2008
In this paper, we propose a new technique to compute irredundant sub-sets of constraint networks. Since, checking redundancy is Co-NP Complete problem, we use different polynomial local consistency entailments for reducing the computational complexity. The obtained constraint network is irredundant modulo a given local consistency.
Chmeiss, Assef +2 more
openaire +3 more sources
In this paper, we propose a new technique to compute irredundant sub-sets of constraint networks. Since, checking redundancy is Co-NP Complete problem, we use different polynomial local consistency entailments for reducing the computational complexity. The obtained constraint network is irredundant modulo a given local consistency.
Chmeiss, Assef +2 more
openaire +3 more sources
2008 Sixth IEEE International Conference on Software Engineering and Formal Methods, 2008
The talk will discuss various proof tools for Csp, show examples of how to analyze systems using these tools, and will also cover recent developments such as the tool HORAE, which is based on constraint satisfaction techniques, and the Csp-CASL-Prover, which provides integrated theorem proving for processes and data.
openaire +2 more sources
The talk will discuss various proof tools for Csp, show examples of how to analyze systems using these tools, and will also cover recent developments such as the tool HORAE, which is based on constraint satisfaction techniques, and the Csp-CASL-Prover, which provides integrated theorem proving for processes and data.
openaire +2 more sources
2005
We present a new class of binary CSPs called extremal CSPs. The CSPs of this class are inconsistent but would become consistent if any pair of variable assignments among the forbidden ones was allowed. Being inconsistent, they cannot be solved by any local repair method.
openaire +1 more source
We present a new class of binary CSPs called extremal CSPs. The CSPs of this class are inconsistent but would become consistent if any pair of variable assignments among the forbidden ones was allowed. Being inconsistent, they cannot be solved by any local repair method.
openaire +1 more source
Journal of Logic and Computation, 1994
The multiplicative fragment of linear logic is studied with the aim to simulate parallel computations. A translation is defined which transforms proofs of this formalism into communicating sequential processes (CSP). This translation is determined by a step-by-step correspondence between the cut-elimination process and the CSP execution. In section 3 a
openaire +1 more source
The multiplicative fragment of linear logic is studied with the aim to simulate parallel computations. A translation is defined which transforms proofs of this formalism into communicating sequential processes (CSP). This translation is determined by a step-by-step correspondence between the cut-elimination process and the CSP execution. In section 3 a
openaire +1 more source
2009
The process algebra CSP is designed for specifying interactions between concurrent systems. In CSP, and related languages, concurrent processes synchronise on common events, while the internal operations of the individual processes are treated abstractly.
Robert Colvin, Ian J. Hayes
openaire +2 more sources
The process algebra CSP is designed for specifying interactions between concurrent systems. In CSP, and related languages, concurrent processes synchronise on common events, while the internal operations of the individual processes are treated abstractly.
Robert Colvin, Ian J. Hayes
openaire +2 more sources
Why Is CSP Failing? Trends and Challenges in CSP Adoption
2014Content Security Policy (CSP) has been proposed as a principled and robust browser security mechanism against content injection attacks such as XSS. When configured correctly, CSP renders malicious code injection and data exfiltration exceedingly difficult for attackers.
Michael Weissbacher +2 more
openaire +1 more source
Semiring-based CSPs and valued CSPs: Basic properties and comparison
1996In this paper we describe two frameworks for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. One is based on a semiring, and the other one on a totally ordered commutative monoid. We then compare the two approaches and we discuss the relationship between them.
Stefano Bistarelli +5 more
openaire +3 more sources