Zobrazeno 1 - 10
of 2 096
pro vyhledávání: '"Wiskunde en Informatica"'
Publikováno v:
MPC
A polytypic function is a function that can be instantiated on many data types to obtain data type specific functionality. Examples of polytypic functions are the functions that can be derived in Haskell, such as show, read, and ‘==’. More advanc
Autor:
Ahn, H.-K., Cheng, S.-W., Cheong, O., Golin, M., van Oostrum, R.W., Geometrie, Beeldwetenschappen en Virtuele Omgevingen, Dep Informatica
Publikováno v:
Computing and Combinatorics, Proc 7th Annual International Conference (COCOON 2001), 2108, 237. Springer-Verlag, Berlin
Hong Kong University of Science and Technology
Theoretical Computer Science, 310(1-3), 457-467. Elsevier
Theoretical Computer Science, 310, 357. Elsevier
Hong Kong University of Science and Technology
Theoretical Computer Science, 310(1-3), 457-467. Elsevier
Theoretical Computer Science, 310, 357. Elsevier
We consider a competitive facility location problem with two players. Players alternate placing points, one at a time, into the playing arena, until each of them has placed n points. The arena is then subdivided according to the nearest-neighbor rule
Autor:
Abe, Kuniyoshi, Sleijpen, G.L.G., Analyse, Analysis, Dep Wiskunde, Sub Analysis begr. 01-01-2014
Publikováno v:
Applied Numerical Mathematics, 67, 4. Elsevier
Any residual polynomial of hybrid Bi-Conjugate Gradient (Bi-CG) methods, as Bi-CG STABilized (Bi-CGSTAB), BiCGstab(ℓ)BiCGstab(ℓ), Generalized Product-type Bi-CG (GPBiCG), and BiCG×MR2BiCG×MR2, can be expressed as the product of a Lanczos polyno
Autor:
Bennett, M.A., Dahmen, S.R., Algebra & Geometry and Mathematical Locic, Algebra en meetkunde, Sub Algebra,Geometry&Mathem. Logic begr.
Publikováno v:
Annals of Mathematics, 177(1), 171. Princeton University Press
If F(x; y) 2 Z[x; y] is an irreducible binary form of degree k 3, then a theorem of Darmon and Granville implies that the generalized superelliptic equation F(x; y) = zl has, given an integer l maxf2; 7 kg, at most nitely many solutions in coprime in
Autor:
Ferdinand Verhulst, Taoufik Bakri
Publikováno v:
Journal of the Indonesian Mathematical Society, Vol 13, Iss 1, Pp 73-90 (2012)
Journal of the Indonesian Mathematical Society, 1. MIHMI
STARTPAGE=1;ISSN=0854-1380;TITLE=Journal of the Indonesian Mathematical Society
Journal of the Indonesian Mathematical Society, 1. MIHMI
STARTPAGE=1;ISSN=0854-1380;TITLE=Journal of the Indonesian Mathematical Society
After reviewing a number of results from geometric singular perturbation theory, we discuss several approaches to obtain periodic solutions in a slow manifold. Regarding nonhyperbolic transitions we consider relaxation oscillations and canard-like so
Autor:
Mats Gyllenberg, Odo Diekmann
Publikováno v:
Journal of Differential Equations. 252:819-851
Using perturbation theory for adjoint semigroups (a modification of sun-star calculus) we prove, in the case of infinite delay, the principle of linearized stability for nonlinear renewal equations, delay-differential equations and coupled systems of
Autor:
Roderik Lindenbergh, M. M. Helsen, Bob E. Schutz, Brian Gunter, Michiel R. van den Broeke, Bert L. A. Vermeersen, Timothy J. Urban, Roderik S. W. van de Wal, Jonathan L. Bamber, Riccardo Riva
Publikováno v:
Earth and Planetary Science Letters
The glacial history of Antarctica during the most recent Milankovitch cycles is poorly constrained relative to the Northern Hemisphere. As a consequence, the contribution of mass changes in the Antarctic ice sheet to global sea-level change and the p
Autor:
Berg, de, M., Cabello, S., Giannopoulos, P., Knauer, C., Oostrum, van, R., Veltkamp, R.C., Hagerup, T., Katajainen, J.
Publikováno v:
International Journal of Computational Geometry and Applications, 19(6), 533-556. World Scientific
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
Algorithm Theory-SWAT 2004 ISBN: 9783540223399
SWAT
Algorithm Theory-SWAT 2004 (Proceedings 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004), 138-149
STARTPAGE=138;ENDPAGE=149;TITLE=Algorithm Theory-SWAT 2004 (Proceedings 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004)
Abstracts 20th European Workshop on Computational Geometry (EuroCG, Sevilla, Spain, March 24-25, 2004), 73-76
STARTPAGE=73;ENDPAGE=76;TITLE=Abstracts 20th European Workshop on Computational Geometry (EuroCG, Sevilla, Spain, March 24-25, 2004)
Scopus-Elsevier
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
Algorithm Theory-SWAT 2004 ISBN: 9783540223399
SWAT
Algorithm Theory-SWAT 2004 (Proceedings 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004), 138-149
STARTPAGE=138;ENDPAGE=149;TITLE=Algorithm Theory-SWAT 2004 (Proceedings 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004)
Abstracts 20th European Workshop on Computational Geometry (EuroCG, Sevilla, Spain, March 24-25, 2004), 73-76
STARTPAGE=73;ENDPAGE=76;TITLE=Abstracts 20th European Workshop on Computational Geometry (EuroCG, Sevilla, Spain, March 24-25, 2004)
Scopus-Elsevier
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the total area of overlap with B. The function describing the area of overlap is
Autor:
Marc van Kreveld, Maarten Löffler
Publikováno v:
Algorithmica. Springer
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest possible convex hulls, measured by length and by area. Generally we assum
Publikováno v:
Theory of Computing Systems. Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. Not only the solution of puzzles leads to interesting questions, but also