Results 251 to 260 of about 24,912 (309)
Converting donor dependence to domestic ownership: The realignment of tuberculosis financing for sustainability. [PDF]
Wells WA +5 more
europepmc +1 more source
Genome shuffling enables quantitative trait locus mapping in Bacillus subtilis. [PDF]
Vasileva DP +18 more
europepmc +1 more source
Genotyping from targeted NGS data based on a small set of SNPs correctly matches patient samples. [PDF]
Yosifov DY +4 more
europepmc +1 more source
Plug-and-play evolution of the Klebsiella pneumoniae capsule locus enables serotype exchange across genetic backgrounds. [PDF]
Le Bris J +3 more
europepmc +1 more source
Extending the starter-unit selection of a collaborating non-reducing polyketide synthase through rational domain swaps. [PDF]
Yin R +7 more
europepmc +1 more source
Swap rate variance swaps [PDF]
We study the hedging and valuation of variance swaps defined on a swap interest rate. Our motivation is the recognition of 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 +3 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 +3 more sources
Networks, 1992
Abstract Each 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 +2 more sources
Abstract Each 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 +2 more sources
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 +4 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 +4 more sources

