Results 251 to 260 of about 19,361 (310)
Carbon-to-nitrogen atom swap enables direct access to benzimidazoles from drug-like indoles. [PDF]
Paschke AK +5 more
europepmc +1 more source
Reply to Pastore, E.P. Comment on "Korkmaz et al. A Deep Learning and Explainable AI-Based Approach for the Classification of Discomycetes Species. Biology 2025, 14, 719". [PDF]
Korkmaz AF +5 more
europepmc +1 more source
Multiple Topology Replica Exchange of Expanded Ensembles for Multidimensional Alchemical Calculations. [PDF]
Friedman AJ, Hsu WT, Shirts MR.
europepmc +1 more source
Automatic Apparent Nasal Index from Single Facial Photographs Using a Lightweight Deep Learning Pipeline: A Pilot Study. [PDF]
Saravi B +10 more
europepmc +1 more source
Critical misalignments in climate pledges reveal imbalanced sustainable development pathways. [PDF]
Larosa F +7 more
europepmc +1 more source
Swap rate variance swaps [PDF]
We study the hedging and valuation of generalized variance swaps defined on a forward swap interest rate. Our motivation is the fundamental role of variance swaps in the transfer of variance risk, and the extensive empirical evidence documenting that the variance realized by interest rates is stochastic.
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Random Structures & Algorithms, 2002
AbstractThe Metropolis‐coupled Markov chain method (or “Swapping Algorithm”) is an empirically successful hybrid Monte Carlo algorithm. It alternates between standard transitions on parallel versions of the system at different parameter values, and swapping two versions.
Neal Madras, Zhongrong Zheng
openaire +2 more sources
AbstractThe Metropolis‐coupled Markov chain method (or “Swapping Algorithm”) is an empirically successful hybrid Monte Carlo algorithm. It alternates between standard transitions on parallel versions of the system at different parameter values, and swapping two versions.
Neal Madras, Zhongrong Zheng
openaire +2 more sources
Networks, 1992
AbstractEach vertex of a graph initially may contain an object of a known type. A final state, specifying the type of object desired at each vertex, is also given. A single vehicle of unit capacity is available for shipping objects among the vertices.
Shoshana Anily, Refael Hassin
openaire +1 more source
AbstractEach vertex of a graph initially may contain an object of a known type. A final state, specifying the type of object desired at each vertex, is also given. A single vehicle of unit capacity is available for shipping objects among the vertices.
Shoshana Anily, Refael Hassin
openaire +1 more source
2005
Wireless mobile terminals have limited storage memory due to weight, size and power constraints. Potentially unlimited virtual memory could be found on remote servers made accessible through a wireless link, but power hungry wireless network interface cards (WNIC) may reduce the battery lifetime if not efficiently exploited, actually limiting the ...
LATTANZI, EMANUELE +2 more
openaire +3 more sources
Wireless mobile terminals have limited storage memory due to weight, size and power constraints. Potentially unlimited virtual memory could be found on remote servers made accessible through a wireless link, but power hungry wireless network interface cards (WNIC) may reduce the battery lifetime if not efficiently exploited, actually limiting the ...
LATTANZI, EMANUELE +2 more
openaire +3 more sources
In [10] we presented a reduced form of risky bond pricing. At the default date a bond seller fail to continue fulfill his obligation and the price of the bond sharply drops down. If the face value of the defaulted bond for no-default scenarios is $1 then the bond price just after default is called its recovery rate (RR). Rating agencies and theoretical
openaire +3 more sources

