Results 281 to 290 of about 2,566,141 (344)
Correction: Structural performance of UHPC-columns reinforced with basalt bars under cyclic loading. [PDF]
Sci RepEl-Sayed TA +3 more
europepmc +1 more source
Correction to: Practical compendium of antiarrhythmic drugs: a clinical consensus statement of the European Heart Rhythm Association of the European Society of Cardiology. [PDF]
Europaceeuropepmc +1 more source
Structome-AlignViewer: On Confidence Assessment in Structure-Aware Alignments. [PDF]
Genome Biol EvolMalik AJ +3 more
europepmc +1 more source
Full-Water Column Turbulence Parameterization of Stratified Waters in Southern Lake Michigan
, 2017 Kyla A Prendergast +2 more
openalex +1 more source
Correction for Srivastava et al., Emergent neuronal mechanisms mediating covert attention in convolutional neural networks. [PDF]
Proc Natl Acad Sci U S Aeuropepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Clinical Psychology Forum, 2009
The September issue editorial characterises the emerging disruption to the climate and environment system as important determinants of human rights violations; the implication being that as professionals we need to step up our defence of human rights. Here I want to develop this idea a bit further by considering what this means for our ethical stance ...
openaire +1 more source
The September issue editorial characterises the emerging disruption to the climate and environment system as important determinants of human rights violations; the implication being that as professionals we need to step up our defence of human rights. Here I want to develop this idea a bit further by considering what this means for our ethical stance ...
openaire +1 more source
ACM SIGLOG News, 2014
In this column, Sylvain Schmitz summarizes two recent advances on the complexity of the reachability problem for vector addition systems with states. This is one of the most celebrated decidable problems in theoretical computer science, and until now, there was absolutely no upper bound on the complexity.
openaire +1 more source
In this column, Sylvain Schmitz summarizes two recent advances on the complexity of the reachability problem for vector addition systems with states. This is one of the most celebrated decidable problems in theoretical computer science, and until now, there was absolutely no upper bound on the complexity.
openaire +1 more source
ACM SIGLOG News, 2022
Descriptive complexity theory initiated by celebrated Fagin's theorem aims to characterize complexity classes by the kind of logic necessary to express problems in the class. For many complexity classes such a characterization has been found; this includes the class NP that, according to Fagin's theorem, can be characterized by the monadic second order
openaire +1 more source
Descriptive complexity theory initiated by celebrated Fagin's theorem aims to characterize complexity classes by the kind of logic necessary to express problems in the class. For many complexity classes such a characterization has been found; this includes the class NP that, according to Fagin's theorem, can be characterized by the monadic second order
openaire +1 more source
New Library World, 1991
Looks at the environmental movement′s attitude to information provision in the context of other sources of environmental information. Reports on new initiatives in the provision of computerised systems for environmental organisations and on environmental information centres.
openaire +1 more source
Looks at the environmental movement′s attitude to information provision in the context of other sources of environmental information. Reports on new initiatives in the provision of computerised systems for environmental organisations and on environmental information centres.
openaire +1 more source