Results 1 to 10 of about 993,843 (191)

A shapley value approach to pricing climate risks [PDF]

, 2011
This paper prices the risk of climate change by calculating a lower bound for the price of a virtual insurance policy against climate risks associated with the business as usual (BAU) emissions path. In analogy with ordinary insurance pricing, this price
Cooke, Roger M
core   +2 more sources

Shortest Paths Avoiding Forbidden Subpaths [PDF]

, 2009
In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P such that no path in X is a subpath of P.
Ahmed, Mustaq, Lubiw, Anna
core   +6 more sources

The minimum energy expenditure shortest path method [PDF]

, 2014
This article discusses the addition of an energy parameter to the shortest path execution process; namely, the energy expenditure by a character during execution of the path.
Choset H., Glass S., Grieve D. W., Guy S. J., International Organizationfor Standardization, Kamphuis A., Khosla P., Kuffner J., Latombe J.-C., Lau M., Mahmudi M., Mousas C., Templer J. A., Transportation Association of Canada, Warren Jr. W. H.   +14 more
core   +1 more source

Energy estimators for random series path-integral methods [PDF]

, 2003
We perform a thorough analysis on the choice of estimators for random series path integral methods. In particular, we show that both the thermodynamic (T-method) and the direct (H-method) energy estimators have finite variances and are straightforward to
Doll, J. D., Freeman, David L., Predescu, Cristian, Sabo, Dubravko   +3 more
core   +4 more sources

Computing a rectilinear shortest path amid splinegons in plane

, 2017
We reduce the problem of computing a rectilinear shortest path between two given points s and t in the splinegonal domain \calS to the problem of computing a rectilinear shortest path between two points in the polygonal domain. As part of this, we define
DP Dobkin, DP Dobkin, DZ Chen, DZ Chen, DZ Chen, EA Melissaratos, H Rohnert, J Hershberger, JA Storer, JSB Mitchell, Pankaj K. Agarwal, R Bar-Yehuda, R Inkulu, S Kapoor, S Kapoor, SK Ghosh, SK Ghosh   +16 more
core   +1 more source

Separation of Variables and the Computation of Fourier Transforms on Finite Groups, II [PDF]

, 2015
We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group.
Maslen, David, Rockmore, Daniel N., Wolff, Sarah   +2 more
core   +3 more sources

Quantum Diagrams and Quantum Networks

, 2014
This paper is an introduction to diagrammatic methods for representing quantum processes and quantum computing. We review basic notions for quantum information and quantum computing.
Kauffman, Louis H., Lomonaco Jr, Samuel J.   +1 more
core   +1 more source

Spatiotemporal Barcodes for Image Sequence Analysis [PDF]

, 2015
Taking as input a time-varying sequence of two-dimensional (2D) binary images, we develop an algorithm for computing a spatiotemporal 0–barcode encoding lifetime of connected components on the image sequence over time.
González Díaz, Rocío, Jiménez Rodríguez, María José, Medrano Garfia, Belén   +2 more
core   +1 more source

One-way quantum computing in superconducting circuits

, 2018
We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster-state provides the quantum resource, while ...
Albarrán-Arriagada, F., Alvarado-Barrios, G., Lamata, L., Retamal, J. C., Romero, G., Sanz, M., Solano, E.   +6 more
core   +1 more source

CAD Adjacency Computation Using Validated Numerics

, 2017
We present an algorithm for computation of cell adjacencies for well-based cylindrical algebraic decomposition. Cell adjacency information can be used to compute topological operations e.g.
Strzebonski, Adam
core   +1 more source