SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "AMNE:(NATURVETENSKAP Matematik Diskret matematik) ;conttype:(refereed)"

Sökning: AMNE:(NATURVETENSKAP Matematik Diskret matematik) > Refereegranskat

  • Resultat 1-10 av 663
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Sorooshian, Shahryar, 1980, et al. (författare)
  • Expedited analytical hierarchical process for multicriteria decision making
  • 2022
  • Ingår i: ICIC Express Letters. - 1881-803X. ; 16:2
  • Tidskriftsartikel (refereegranskat)abstract
    • In this study, a procedure to overcome analytical hierarchical process (AHP) limitations was developed and tested, and a tool created via pairwise comparison chart and weighted sum method hybridization was introduced. In addition, a multicriteria decision-making software was selected to validate the constructed hybrid decision-making tool. The software was formulated based on an established decision-making technique. Data for the comparison analysis were obtained from an ongoing research, and output from the comparison analysis provided evidence for the accuracy of the constructed tool. The proposed hybridized method aligned with AHP reasoning but demonstrated a faster process; hence, it was called ‘expedited AHP’.
  •  
2.
  • Asratian, Armen, et al. (författare)
  • Proper path-factors and interval edge-coloring of (3,4)-biregular bigraphs
  • 2009
  • Ingår i: Journal of Graph Theory. - : Wiley Periodicals Inc.. - 0364-9024 .- 1097-0118. ; 61:2, s. 88-97
  • Tidskriftsartikel (refereegranskat)abstract
    • An interval coloring of a graph G is a proper coloring of E(G) by positive integers such that the colors on the edges incident to any vertex are consecutive. A (3,4)-biregular bigraph is a bipartite graph in which each vertex of one part has degree 3 and each vertex of the other has degree 4; it is unknown whether these all have interval colorings. We prove that G has an interval coloring using 6 colors when G is a (3,4)-biregular bigraph having a spanning subgraph whose components are paths with endpoints at 3-valent vertices and lengths in {2, 4, 6, 8}. We provide several sufficient conditions for the existence of such a subgraph.
  •  
3.
  • Sorooshian, Shahryar, 1980, et al. (författare)
  • Performance of the decision-making trial and evaluation laboratory
  • 2023
  • Ingår i: AIMS Mathematics. - : American Institute of Mathematical Sciences (AIMS). - 2473-6988. ; 8:3, s. 7490-7514
  • Tidskriftsartikel (refereegranskat)abstract
    • Multiple attribute decision-making (MADM) techniques constitute a practical approach for solving complex problems involving multiple and often conflicting criteria. Decision-making trial and evaluation laboratory (DEMATEL) is a popular MADM technique with both admirers and critics. This study presents a comprehensive review of DEMATEL through bibliometric analysis using the Scopus database. This article examined 3,521 papers published in journals, conferences or books between 1981 and 2023. We examined a few parameters for commenting on the performance of the technique. Among them are research outputs, the network of DEMATEL users, implementation subject areas, research zones, financing opportunities and publication hosts and their impact trends. We conclude from the findings of this study that the DEMATEL is capable of dealing with modern problem-solving in future environments. Although the growth of new MADMs is obvious, based on the gathered data, we forecast that more than 776 documents will be published in 2025 using DEMATEL for problem-solving. This expanding tendency will continue in the future. As distinct MADMs have diverse constraints, foundations, computing complexity and standpoints, which result in different performances, outmoded low-performance MADM techniques must be reported by researchers to continue this paper’s objective to minimize ambiguity among decision-makers and practitioners. To facilitate such a comparison in the future, a quantitative performance coefficient was also developed here.
  •  
4.
  • Discrete Geometry and Mathematical Morphology : First International Joint Conference, DGMM 2021, Uppsala, Sweden, May 24–27, 2021, Proceedings
  • 2021
  • Samlingsverk (redaktörskap) (refereegranskat)abstract
    • This book constitutes the proceedings of the First IAPR International Conference on Discrete Geometry and Mathematical Morphology, DGMM 2021, which was held during May 24-27, 2021, in Uppsala, Sweden.The conference was created by joining the International Conference on Discrete Geometry for computer Imagery, DGCI, with the International Symposium on Mathematical Morphology, ISMM.The 36 papers included in this volume were carefully reviewed and selected from 59 submissions. They were organized in topical sections as follows: applications in image processing, computer vision, and pattern recognition; discrete and combinatorial topology; discrete geometry - models, transforms, visualization; discrete tomography and inverse problems; hierarchical and graph-based models, analysis and segmentation; learning-based approaches to mathematical morphology; multivariate and PDE-based mathematical morphology, morphological filtering.The book also contains 3 invited keynote papers.
  •  
5.
  • Ekedahl, Torsten, 1955- (författare)
  • Shellability of a Poset of Polygonal Subdivisions
  • 2009
  • Ingår i: The Electronic Journal of Combinatorics. - : Annals of Mathematics. - 1097-1440 .- 1077-8926. ; 16:2, s. R23-
  • Tidskriftsartikel (refereegranskat)
  •  
6.
  • Fleischner, Herbert, et al. (författare)
  • Circuit double covers in special types of cubic graphs
  • 2009
  • Ingår i: Discrete Mathematics. - : Elsevier BV. - 0012-365X .- 1872-681X. ; 309:18, s. 5724-5728
  • Tidskriftsartikel (refereegranskat)abstract
    • Suppose that a 2-connected cubic graph G of order n has a circuit C of length at least n−4 such that G−V(C) is connected. We show that G has a circuit double cover containing a prescribed set of circuits which satisfy certain conditions. It follows that hypohamiltonian cubic graphs (i.e., non-hamiltonian cubic graphs G such that G−v is hamiltonian for every v∈V(G)) have strong circuit double covers.
  •  
7.
  •  
8.
  • Holmgren, Cecilia, 1984- (författare)
  • Novel Characteristics of Split Trees by use of Renewal Theory
  • 2012
  • Ingår i: Electronic Journal of Probability. - 1083-6489 .- 1083-6489. ; 17, s. 5-
  • Tidskriftsartikel (refereegranskat)abstract
    • We investigate characteristics of random split trees introduced by Devroye [SIAM J Comput 28, 409-432, 1998]; split trees include e. g., binary search trees, m-ary search trees, quadtrees, median of (2k + 1)-trees, simplex trees, tries and digital search trees. More precisely: We use renewal theory in the studies of split trees, and use this theory to prove several results about split trees. A split tree of cardinality n is constructed by distributing n balls (which often represent data) to a subset of nodes of an infinite tree. One of our main results is a relation between the deterministic number of balls n and the random number of nodes N. In [5] there is a central limit law for the depth of the last inserted ball so that most nodes are close to depth lnn/mu + O(root lnn), where mu is some constant depending on the type of split tree; we sharpen this result by finding an upper bound for the expected number of nodes with depths >= lnn/mu - ln(1/2+epsilon) n or depths <= lnn/mu + ln(1/2+epsilon) n for any choice of epsilon > 0. We also find the first asymptotic of the variances of the depths of the balls in the tree.
  •  
9.
  • Holmgren, Cecilia, 1984- (författare)
  • Random Records and Cuttings in Binary Search Trees
  • 2010
  • Ingår i: Combinatorics, probability & computing. - 0963-5483 .- 1469-2163. ; 19:3, s. 391-424
  • Tidskriftsartikel (refereegranskat)abstract
    • We study the number of random records in a  binary search tree with n vertices (or equivalently, the number of cuttings required to eliminate the tree). We show that a classical limit theorem for convergence of sums of triangular arrays to infinitely divisible distributions can be used to determine the distribution of this number. The asymptotic distribution of the (normalized) number of records or cuts is found to be weakly 1-stable.
  •  
10.
  • Kiselman, Christer, 1939- (författare)
  • Functions on discrete sets holomorphic in the sense of Ferrand, or monodiffric functions of the second kind
  • 2008
  • Ingår i: Science in China Series A. - : Springer Science and Business Media LLC. - 1006-9283 .- 1862-2763. ; 51:4, s. 604-619
  • Tidskriftsartikel (refereegranskat)abstract
    • We study the class of functions called monodiffric of the second kind by Isaacs. They are discrete analogues of holomorphic functions of one or two complex variables. Discrete analogues of the Cauchy-Riemann operator, of domains of holomorphy in one discrete variable, and of the Hartogs phenomenon in two discrete variables are investigated. Two fundamental solutions to the discrete Cauchy-Riemann equation are studied: one with support in a quadrant, the other with decay at infinity. The first is easy to construct by induction; the second is accessed via its Fourier transform.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 663
Typ av publikation
tidskriftsartikel (483)
konferensbidrag (162)
bokkapitel (7)
samlingsverk (redaktörskap) (3)
proceedings (redaktörskap) (3)
rapport (2)
visa fler...
bok (1)
annan publikation (1)
forskningsöversikt (1)
visa färre...
Typ av innehåll
Författare/redaktör
Jäger, Gerold (48)
Markström, Klas (37)
Damaschke, Peter, 19 ... (26)
Casselgren, Carl Joh ... (25)
Stokes, Klara (17)
Sjöstrand, Jonas (14)
visa fler...
Falgas-Ravry, Victor (14)
Öhman, Lars-Daniel (13)
Sladoje, Nataša (12)
Westerbäck, Thomas (12)
Lindblad, Joakim (11)
Strömberg, Ann-Brith ... (11)
Wagner, Stephan (11)
Hollanti, Camilla (10)
Freij-Hollanti, Ragn ... (10)
Goldengorin, Boris (10)
Strand, Robin, 1978- (9)
Molitor, Paul (9)
Hegarty, Peter, 1971 (9)
Srivastav, Anand (8)
Eriksen, Niklas, 197 ... (8)
Tomon, István (8)
Linusson, Svante (7)
Jonsson, Peter (7)
Janson, Svante, 1955 ... (7)
Eriksson, Kimmo, 196 ... (7)
Lo, Allan (7)
Skerman, Fiona (6)
Kleinschmidt, Axel (6)
Eriksson, Henrik (6)
Lundow, Per Håkan (6)
Hellmuth, Marc (6)
Ferroni, Luis (6)
Sharifzadeh, Maryam (6)
Larsson, Urban, 1965 (6)
Yang, Jian, 1960 (5)
Lingas, Andrzej (5)
Persson, Daniel, 197 ... (5)
Carlson, Johan, 1972 (5)
Almgren, Torgny, 196 ... (5)
Stadler, Peter F. (5)
Casselgren, Carl Joh ... (5)
Asratian, Armen (5)
Petrosyan, Petros A. (5)
Björklund, Andreas (5)
Bras-Amorós, Maria (5)
Solus, Liam (5)
Pham, Lan Anh (5)
Day, A. Nicholas (5)
Martinsson, Anders, ... (5)
visa färre...
Lärosäte
Chalmers tekniska högskola (172)
Umeå universitet (159)
Kungliga Tekniska Högskolan (100)
Uppsala universitet (88)
Linköpings universitet (69)
Göteborgs universitet (62)
visa fler...
Mälardalens universitet (38)
Stockholms universitet (30)
Lunds universitet (23)
Sveriges Lantbruksuniversitet (10)
Mittuniversitetet (6)
Högskolan i Skövde (6)
Luleå tekniska universitet (5)
Örebro universitet (5)
Högskolan i Halmstad (3)
Högskolan Väst (2)
Jönköping University (2)
Malmö universitet (2)
Högskolan i Borås (2)
Högskolan i Gävle (1)
Linnéuniversitetet (1)
Karlstads universitet (1)
Högskolan Dalarna (1)
Blekinge Tekniska Högskola (1)
visa färre...
Språk
Engelska (661)
Svenska (1)
Franska (1)
Forskningsämne (UKÄ/SCB)
Naturvetenskap (662)
Teknik (62)
Samhällsvetenskap (11)
Humaniora (2)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy