Results 261 to 270 of about 10,180,971 (304)
Some of the next articles are maybe not open access.
Reducing risk, reducing pollution
2010“We aren't passengers on Spaceship Earth; we're the crew. We aren't residents of this planet; we're citizens. The difference in both cases is responsibility.” Astronaut Rusty Schweikart Some pollution problems are daunting; others less so. This chapter begins with a brief overview as to how we can separate the “trivial” from the serious, whether the
openaire +1 more source
2015
In the Map-Reduce programming model for data parallel computation, a reducer computes an output from a list of input values associated with a key. The inputs however may not arrive at a reducer in a fixed order due to non-determinism in transmitting key-value pairs over the network.
Yu-Fang Chen 0001 +3 more
openaire +1 more source
In the Map-Reduce programming model for data parallel computation, a reducer computes an output from a list of input values associated with a key. The inputs however may not arrive at a reducer in a fixed order due to non-determinism in transmitting key-value pairs over the network.
Yu-Fang Chen 0001 +3 more
openaire +1 more source
Ukrainian Mathematical Journal, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Ars Comb., 1998
A snark is a simple, cyclically 4-edge connected cubic graph with girth at least 5 and chromatic index 4. A cubic graph \(G\) is vertex-reducible to a simple cubic graph \(G'\) if \(G'\) can be obtained from \(G\) by removing two vertices together with all incident edges from \(G\) and adding new edges to obtain \(G'\).
Gunnar Brinkmann, Eckhard Steffen
openaire +2 more sources
A snark is a simple, cyclically 4-edge connected cubic graph with girth at least 5 and chromatic index 4. A cubic graph \(G\) is vertex-reducible to a simple cubic graph \(G'\) if \(G'\) can be obtained from \(G\) by removing two vertices together with all incident edges from \(G\) and adding new edges to obtain \(G'\).
Gunnar Brinkmann, Eckhard Steffen
openaire +2 more sources
Reduced Order and Surrogate Models for Gravitational Waves
Living Reviews in Relativity, 2022Aaron Villanueva, Manuel Tiglio
exaly
Tools for Reduced Precision Computation
ACM Computing Surveys, 2021Giovanni Agosta, Stefano Cherubin
exaly