Results 251 to 260 of about 82,016 (303)
Cold platelets, redefined: pathogen reduction without surrendering hemostatic intent. [PDF]
Blood TransfusCognasse F +3 more
europepmc +1 more source
Age-Related Differences in Corticospinal Function and Muscle Strength: A Systematic Review and Meta-Analysis. [PDF]
Eur J NeurosciAdugna DG +5 more
europepmc +1 more source
Green chitosan-starch-polyvinyl alcohol bio-composite hydrogel for zirconium capture from zircon raffinate. [PDF]
BMC ChemDakroury GA, Abdo SM, El Shazly EAA.
europepmc +1 more source
It's time to put plastics on the health security agenda: a call to action for Indonesia and Australia. [PDF]
BMJ Glob HealthSalsabilla SA +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +4 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 +4 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