Zobrazeno 1 - 10
of 300
pro vyhledávání: '"Pinar, Alİ"'
We consider the problem of minimizing costs in the generation unit commitment problem, a cornerstone in electric power system operations, while enforcing an -- reliability criterion. This reliability criterion is a generalization of the well-known -
Externí odkaz:
http://hdl.handle.net/10150/623036
http://arizona.openrepository.com/arizona/handle/10150/623036
http://arizona.openrepository.com/arizona/handle/10150/623036
Finding $k$-cores in graphs is a valuable and effective strategy for extracting dense regions of otherwise sparse graphs. We focus on the important problem of maintaining cores on rapidly changing dynamic graphs, where batches of edge changes need to
Externí odkaz:
http://arxiv.org/abs/2203.13095
Autor:
Toker, Mustafa, Pınar, Ali
Publikováno v:
In Journal of Asian Earth Sciences 15 July 2024 271
Uncertainty sets are at the heart of robust optimization (RO) because they play a key role in determining the RO models' tractability, robustness, and conservativeness. Different types of uncertainty sets have been proposed that model uncertainty fro
Externí odkaz:
http://arxiv.org/abs/2107.04977
Protecting against multi-step attacks of uncertain duration and timing forces defenders into an indefinite, always ongoing, resource-intensive response. To effectively allocate resources, a defender must be able to analyze multi-step attacks under as
Externí odkaz:
http://arxiv.org/abs/2107.04075
Centrality rankings such as degree, closeness, betweenness, Katz, PageRank, etc. are commonly used to identify critical nodes in a graph. These methods are based on two assumptions that restrict their wider applicability. First, they assume the exact
Externí odkaz:
http://arxiv.org/abs/1711.10634
The degree distribution is one of the most fundamental properties used in the analysis of massive graphs. There is a large literature on graph sampling, where the goal is to estimate properties (especially the degree distribution) of a large graph th
Externí odkaz:
http://arxiv.org/abs/1710.08607
Finding the dense regions of a graph and relations among them is a fundamental problem in network analysis. Core and truss decompositions reveal dense subgraphs with hierarchical relations. The incremental nature of algorithms for computing these dec
Externí odkaz:
http://arxiv.org/abs/1704.00386
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Sariyuce, A. Erdem, Pinar, Ali
Finding dense bipartite subgraphs and detecting the relations among them is an important problem for affiliation networks that arise in a range of domains, such as social network analysis, word-document clustering, the science of science, internet ad
Externí odkaz:
http://arxiv.org/abs/1611.02756