Results 261 to 270 of about 19,361 (310)
Some of the next articles are maybe not open access.
Information Processing Letters, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amihood Amir +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amihood Amir +2 more
openaire +2 more sources
1993
The swap in its simplest form can be described as a periodic exchange (or ‘swap’) of payments between two counterparties for a specified period of time; the exchange is generally based on interest rates, currency rates or commodity prices. The actual exchange of payments is governed by a contractual agreement between the participants and is reflected ...
openaire +1 more source
The swap in its simplest form can be described as a periodic exchange (or ‘swap’) of payments between two counterparties for a specified period of time; the exchange is generally based on interest rates, currency rates or commodity prices. The actual exchange of payments is governed by a contractual agreement between the participants and is reflected ...
openaire +1 more source
Minds and Machines, 2018
Triviality arguments against the computational theory of mind claim that computational implementation is trivial and thus does not serve as an adequate metaphysical basis for mental states. It is common to take computational implementation to consist in a mapping from physical states to abstract computational states.
openaire +1 more source
Triviality arguments against the computational theory of mind claim that computational implementation is trivial and thus does not serve as an adequate metaphysical basis for mental states. It is common to take computational implementation to consist in a mapping from physical states to abstract computational states.
openaire +1 more source
Proceedings 38th Annual Symposium on Foundations of Computer Science, 2000
Summary: Let a text string \(T\) of \(n\) symbols and a pattern string \(P\) of \(m\) symbols from alphabet \(\Sigma\) be given. A swapped version \(T'\) of \(T\) is a length \(n\) string derived from \(T\) by a series of local swaps (i.e., \(t_\ell'\leftarrow t_{\ell+1}\) and \(t_{\ell+1}'\leftarrow t_\ell\)), where each element can participate in no ...
Amihood Amir +4 more
openaire +2 more sources
Summary: Let a text string \(T\) of \(n\) symbols and a pattern string \(P\) of \(m\) symbols from alphabet \(\Sigma\) be given. A swapped version \(T'\) of \(T\) is a length \(n\) string derived from \(T\) by a series of local swaps (i.e., \(t_\ell'\leftarrow t_{\ell+1}\) and \(t_{\ell+1}'\leftarrow t_\ell\)), where each element can participate in no ...
Amihood Amir +4 more
openaire +2 more sources
Journal of Computational Biology, 2003
A short swap is an operation on a permutation that switches two elements that have at most one element between them. This paper investigates the problem of finding a minimum-length sorting sequence of short swaps for a given permutation. A polynomial-time 2-approximation algorithm for this problem is presented, and bounds for the short-swap diameter ...
Lenwood S. Heath, John Paul C. Vergara
openaire +2 more sources
A short swap is an operation on a permutation that switches two elements that have at most one element between them. This paper investigates the problem of finding a minimum-length sorting sequence of short swaps for a given permutation. A polynomial-time 2-approximation algorithm for this problem is presented, and bounds for the short-swap diameter ...
Lenwood S. Heath, John Paul C. Vergara
openaire +2 more sources
, 2009 Swaps are versatile financial derivatives that create contracts to exchange future cash flows. Throughout the last several decades the uses and importance of swaps have grown substantially.
Rizzolo, Michael
openaire +3 more sources
The Swapping Problem on a Line
SIAM Journal on Computing, 1999Summary: The authors consider the problem of optimally swapping objects between \(N\) workstations, which is referred to as nodes, located on a line. There are \(m\) types of objects, and the set of object-types is denoted by \(S = \{1, \dots, m\}\). Object-type 0 is a dummy type, the null object.
Shoshana Anily +2 more
openaire +2 more sources
Debt-for-climate swaps: Killing two birds with one stone?
Global Environmental Change, 2021Dennis Essers +2 more
exaly