Výsledky vyhledávání - "combinatorial algorithms"

Parallel Graph Partitioning for Complex Networks Autor Meyerhenke, Henning, Sanders, Peter, Schulz, Christian

“…Processing large complex networks like social networks or web graphs has attracted considerable interest. To do this in parallel, we need to partition them…”
Získat plný text

Finding maximal closed substrings Autor Badkobeh, Golnaz, De Luca, Alessandro, Fici, Gabriele, Puglisi, Simon J.

“…A string is closed if it has length 1 or has a nonempty border without internal occurrences. In this paper, we introduce the notion of a maximal closed…”
Získat plný text

The complexity of binary matrix completion under diameter constraints Autor Koana, Tomohiro, Froese, Vincent, Niedermeier, Rolf

“…We thoroughly study a novel but basic combinatorial matrix completion problem: Given a binary incomplete matrix, fill in the missing entries so that every pair…”
Získat plný text

Computing distance-based topological descriptors of complex chemical networks: New theoretical techniques Autor Hayat, Sakander

“…[Display omitted] •A computational technique for certain topological descriptors is presented.•It generalizes a previous technique from chemical graphs to…”
Získat plný text

GraMeR: Graph Meta Reinforcement learning for multi-objective influence maximization Autor Munikoti, Sai, Natarajan, Balasubramaniam, Halappanavar, Mahantesh

“…Influence maximization (IM) is a combinatorial problem of identifying a subset of seed nodes in a network (graph), which when activated, provide a maximal…”
Získat plný text

The inverse k-max combinatorial optimization problem Autor Nhan, Tran, Nguyen, Kien, Hung, Nguyen, Toan, Nguyen

“…Classical combinatorial optimization concerns finding a feasible subset of a ground set in order to optimize an objective function. We address in this article…”
Získat plný text

基于DBO-VMD和IWOA-BILSTM神经网络组合模型的短期电力负荷预测 Autor 刘杰, 从兰美, 夏远洋, 潘广源, 赵汉超, 韩子月

“…新能源在现代电力系统中占比不断提高,其负荷不规律性、波动性远大于传统电力系统,这就导致负荷预测精度不高.针对这个问题,提出了蜣螂优化(dung beetle optimizer,DBO)算法…”
Získat plný text

Scaling Stratified Stochastic Gradient Descent for Distributed Matrix Completion Autor Abubaker, Nabil, Karsavuran, M. Ozan, Aykanat, Cevdet

“…Stratified SGD (SSGD) is the primary approach for achieving serializable parallel SGD for matrix completion. State-of-the-art parallelizations of SSGD fail to…”
Získat plný text

Edge Exploration of Temporal Graphs Autor Bumpus, Benjamin Merlin, Meeks, Kitty

“…We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast to the static case, it is NP -hard to determine whether a given…”
Získat plný text

A new model and algorithms in firefighting theory Autor Klein, Rolf, Kübel, David, Langetepe, Elmar, Sack, Jörg-Rüdiger, Schwarzwald, Barbara

“…Continuous and discrete models as well as algorithms Bressan (2007) and Finbow and MacGillivray (2009) for firefighting problems are well-studied in…”
Získat plný text

Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters Autor Kučera, Martin, Suchý, Ondřej

“…The Minimum Eccentricity Shortest Path Problem consists in finding a shortest path with minimum eccentricity in a given undirected graph. The problem is known…”
Získat plný text

Safe RuleFit: Learning Optimal Sparse Rule Model by Meta Safe Screening Autor Kato, Hiroki, Hanada, Hiroyuki, Takeuchi, Ichiro

“…We consider the problem of learning a sparse rule model , a prediction model in the form of a sparse linear combination of rules, where a rule is an indicator…”
Získat plný text

On Modularity Clustering Autor Brandes, U., Delling, D., Gaertler, M., Gorke, R., Hoefer, M., Nikoloski, Z., Wagner, D.

“…Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines,…”
Získat plný text

Failure analysis and control of natural gas pipelines under excavation impact based on machine learning scheme Autor Xu, Duo, Chen, Liqiong, Yu, Chang, Zhang, Sen, Zhao, Xiang, Lai, Xin

“…Third-party excavation operations pose a serious threat to the safe operation of natural gas pipelines, and quantifying the failure conditions of pipelines can…”
Získat plný text

Exact combinatorial algorithms for solving the bin covering problems with strong divisibility and rejection profit Autor Li, Jianping, Cai, Lijian, Lichen, Junran, Pan, Pengxiang

Získat plný text

Augmented data routing algorithms for satellite delay-tolerant networks. Development and validation Autor Fedorov, Andrei A., Soshilov, Igor V., Loginov, Valery N.

Získat plný text

A new algorithm for generating integer partitions and its parallel implementations on CPU and FPGA Autor Nałęcz, Marek, Mazurek, Gustaw

“…In this paper, the long-known bit representation of integer partitions was used in a novel way to develop an algorithm for generating the next partition of an…”
Získat plný text

Maximum Flow by Augmenting Paths in n^ Time Autor Bernstein, Aaron, Blikstad, Joakim, Saranurak, Thatchaphol, Tu, Ta-Wei

“…We present a combinatorial algorithm for computing exact maximum flows in directed graphs with n vertices and edge capacities from \{1, \ldots, U\} in…”
Získat plný text

Eulerian Walks in Temporal Graphs Autor Marino, Andrea, Silva, Ana

“…An Eulerian walk (or Eulerian trail) is a walk (resp. trail) that visits every edge of a graph G at least (resp. exactly) once. This notion was first discussed…”
Získat plný text

Dynamic Programming and Graph Algorithms in Computer Vision Autor Felzenszwalb, P F, Zabih, R

“…Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems…”
Získat plný text