標題: Titlebook: Computing and Combinatorics; 29th International C Weili Wu,Guangmo Tong Conference proceedings 2024 The Editor(s) (if applicable) and The A [打印本頁] 作者: 可擴大 時間: 2025-3-21 19:55
書目名稱Computing and Combinatorics影響因子(影響力)
書目名稱Computing and Combinatorics影響因子(影響力)學科排名
書目名稱Computing and Combinatorics網(wǎng)絡(luò)公開度
書目名稱Computing and Combinatorics網(wǎng)絡(luò)公開度學科排名
書目名稱Computing and Combinatorics被引頻次
書目名稱Computing and Combinatorics被引頻次學科排名
書目名稱Computing and Combinatorics年度引用
書目名稱Computing and Combinatorics年度引用學科排名
書目名稱Computing and Combinatorics讀者反饋
書目名稱Computing and Combinatorics讀者反饋學科排名
作者: 笨拙的我 時間: 2025-3-21 22:44 作者: CRUMB 時間: 2025-3-22 01:43
Greedy Gray Codes for?Dyck Words and?Ballot Sequencesr from each other by a transposition, that is, two bit changes. Our Gray codes are both homogeneous and suffix partitioned. Furthermore, we use our greedy algorithm to produce the first known homogeneous 2-Gray code for ballot sequences, which are Dyck prefixes of all weights. Our work extends a pre作者: 動作謎 時間: 2025-3-22 06:12
Efficiently-Verifiable Strong Uniquely Solvable Puzzles and Matrix Multiplicationng uniquely solvable puzzles (SUSP), which we call .. We show that these puzzles are efficiently verifiable, which remains an open question for general SUSPs. We also show that individual simplifiable SUSPs can achieve the same bounds on the matrix multiplication exponent . that infinite families of作者: 條約 時間: 2025-3-22 10:20
Matrix and?Vector Products for?Inputs Decomposable into?Few Monotone Subsequencess of the first matrix and the columns of the second matrix can be decomposed into. In particular, we show that if each row of the first matrix can be decomposed into at most . monotone subsequences and each column of the second matrix can be decomposed into at most . monotone subsequences such that 作者: Assignment 時間: 2025-3-22 15:42 作者: Assignment 時間: 2025-3-22 20:49
An Approach to Agent Path Planning Under Temporal Logic Constraints that are constrained by temporal properties, such as conditional reachability, safety, and liveness. Our work presents an integrated approach that combines reinforcement learning (RL) with multi-objective optimization to address path planning problems with the consideration of temporal logic constr作者: malapropism 時間: 2025-3-23 00:33
The Heterogeneous Rooted Tree Cover Problemn . satisfying the triangle inequality, a vertex-weight function ., and . construction teams having nonuniform construction speeds ., ., ., ., we are asked to find . trees for these . construction teams to cover all vertices in ., each tree starting at the same root ., ., . trees having a sole commo作者: 比喻好 時間: 2025-3-23 04:56
The Hardness of?Optimization Problems on?the?Weighted Massively Parallel Computation Models of network topology. The work of Hu et al. on topology-aware MPC model considers only the tree topology. In this paper a more general case is considered, where the underlying network is a weighted complete graph. We then call this model Weighted Massively Parallel Computation (WMPC) model, and stu作者: Small-Intestine 時間: 2025-3-23 08:04
The Regularized Submodular Maximization via?the?Lyapunov MethodThe Regularized Submodular Maximization can be viewed as a generalization of the Submodular Maximization since it adds an extra linear regular term (possibly negative) to the objective so that it may no longer be non-negative. For Regularized Non-monotone Submodular Maximization (RegularizedNSM), we作者: GIBE 時間: 2025-3-23 11:40
Topological Network-Control Games two parties aiming to control a given network. In a such game given the network, the players move alternatively. At each turn, a player selects an unclaimed vertex and its unclaimed neighbours within distance .. The players obey the topological condition that all claimed vertices stay connected. Th作者: 佛刊 時間: 2025-3-23 15:24
Lower Bounds of?Functions on?Finite Abelian Groupsrial problems, such as MAX-SAT, MAX-CUT and the knapsack problem, can be recognized as optimization problems on the group .. This paper proposes an algorithm that efficiently computes verifiable lower bounds of functions on finite abelian groups by the technique of the Fourier sum of squares with er作者: 止痛藥 時間: 2025-3-23 19:53 作者: GREEN 時間: 2025-3-23 23:18
Random Shortening of?Linear Codes and?Applicationsng explicit constructions matching the parameters of RLCs is challenging, and RLCs are hard to decode efficiently. This motivated several previous works to study the problem of partially derandomizing RLCs, by applying certain operations to an explicit mother code. Among them, one of the most well s作者: thwart 時間: 2025-3-24 05:42
Algorithms for?Full-View Coverage of?Targets with?Group Set Coverme slices, two methods (TSC-FTC, FTC-TW) based on Group Set Cover have been proposed to optimize full-view coverage of targets problem. In TSC-FTC, the set of sensors that can cover the most targets are chosen using Group Set Cover in each time slice, and the total number of targets covered througho作者: sinoatrial-node 時間: 2025-3-24 07:52 作者: CANT 時間: 2025-3-24 13:08 作者: Angiogenesis 時間: 2025-3-24 15:47 作者: 加強防衛(wèi) 時間: 2025-3-24 21:06
978-3-031-49192-4The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: 提名 時間: 2025-3-24 23:38 作者: 代理人 時間: 2025-3-25 06:04 作者: 蓋他為秘密 時間: 2025-3-25 09:39 作者: Flagging 時間: 2025-3-25 14:09
https://doi.org/10.1007/1-4020-4203-5m consists of two phases: first construct a decision diagram (.,?.) that somehow represents a given . constraint matrix, and then build an equivalent set of |.| linear constraints over . variables. That is, the size of the resultant extended formulation depends not explicitly on the number . of the 作者: 破譯密碼 時間: 2025-3-25 16:02
Pseudo-Thinking and Real Thinking,r from each other by a transposition, that is, two bit changes. Our Gray codes are both homogeneous and suffix partitioned. Furthermore, we use our greedy algorithm to produce the first known homogeneous 2-Gray code for ballot sequences, which are Dyck prefixes of all weights. Our work extends a pre作者: 財政 時間: 2025-3-25 22:24 作者: 陰謀 時間: 2025-3-26 03:15
Aesthetic Judgment: The Legacy of Kants of the first matrix and the columns of the second matrix can be decomposed into. In particular, we show that if each row of the first matrix can be decomposed into at most . monotone subsequences and each column of the second matrix can be decomposed into at most . monotone subsequences such that 作者: Calculus 時間: 2025-3-26 04:45
Art as a Synthesis of Form and Expressionre is a point particle at each point in .. When we activate a . at a point ., each particle in . greedily moves toward .. For a point ., if the particle at . reaches ., we say . . .. We call a point . a . of . if a beacon at . attracts all points in .. The . of . is defined as the set of all beacon 作者: ROOF 時間: 2025-3-26 10:47
The Post-structuralist Perspective that are constrained by temporal properties, such as conditional reachability, safety, and liveness. Our work presents an integrated approach that combines reinforcement learning (RL) with multi-objective optimization to address path planning problems with the consideration of temporal logic constr作者: Virtues 時間: 2025-3-26 13:26 作者: 不確定 時間: 2025-3-26 19:37 作者: 廣口瓶 時間: 2025-3-26 23:44
The Post-structuralist PerspectiveThe Regularized Submodular Maximization can be viewed as a generalization of the Submodular Maximization since it adds an extra linear regular term (possibly negative) to the objective so that it may no longer be non-negative. For Regularized Non-monotone Submodular Maximization (RegularizedNSM), we作者: degradation 時間: 2025-3-27 04:18
The Post-structuralist Perspective two parties aiming to control a given network. In a such game given the network, the players move alternatively. At each turn, a player selects an unclaimed vertex and its unclaimed neighbours within distance .. The players obey the topological condition that all claimed vertices stay connected. Th作者: 外科醫(yī)生 時間: 2025-3-27 06:48
The Post-structuralist Perspectiverial problems, such as MAX-SAT, MAX-CUT and the knapsack problem, can be recognized as optimization problems on the group .. This paper proposes an algorithm that efficiently computes verifiable lower bounds of functions on finite abelian groups by the technique of the Fourier sum of squares with er作者: braggadocio 時間: 2025-3-27 12:35
https://doi.org/10.1007/978-1-4020-5638-3there exists a set of at least . edge-disjoint triangles in ., while . aims to find out whether there exists a set of at most . edges that intersects all triangles in .. Previous research has shown that . has a kernel of . vertices, while . has a kernel of 6. vertices. In this paper, we show that th作者: 填滿 時間: 2025-3-27 15:30 作者: AFFIX 時間: 2025-3-27 20:58
Aesthetic Judgment: The Legacy of Kantme slices, two methods (TSC-FTC, FTC-TW) based on Group Set Cover have been proposed to optimize full-view coverage of targets problem. In TSC-FTC, the set of sensors that can cover the most targets are chosen using Group Set Cover in each time slice, and the total number of targets covered througho作者: Debrief 時間: 2025-3-28 01:18
Photographic Practice and Art Theory,es. 39, 11 (2012), 2666-2678]. In particular, we disprove their conjectured upper bound for the number of color changes by giving a linear lower bound. We show that the recursive greedy heuristics is not optimal by providing a tiny improvement. We also introduce a new heuristics, recursive star gree作者: Graphite 時間: 2025-3-28 02:12
Remnants: The Witness and the Animalast one HGT. More formally, the directed Fitch graph has a set of genes as its vertices, and directed edges (.,?.) for all pairs of genes . and . for which . has been horizontally transferred at least once since it diverged from the last common ancestor of . and .. Subgraphs of Fitch graphs can be i作者: 繞著哥哥問 時間: 2025-3-28 09:41 作者: 騷動 時間: 2025-3-28 11:54 作者: choleretic 時間: 2025-3-28 15:35
Art and Society: A Neomarxist Perspectivethe two problems in different communication pattern with the four kinds of objective cost functions, 8 problems are obtained. The hardness results of the 8 problems make up the content of this paper. With rigorous proof, we prove that some of the 8 problems are in P, some FPT, some NP-complete, and 作者: 全部 時間: 2025-3-28 19:41 作者: aerial 時間: 2025-3-29 00:24 作者: Ingratiate 時間: 2025-3-29 03:29 作者: Antagonism 時間: 2025-3-29 10:28 作者: NUDGE 時間: 2025-3-29 12:51 作者: 軍火 時間: 2025-3-29 19:03 作者: 最低點 時間: 2025-3-29 22:03 作者: 偏見 時間: 2025-3-30 03:49 作者: 殺蟲劑 時間: 2025-3-30 07:57
https://doi.org/10.1007/1-4020-4203-5sentations for the matrices. We demonstrate the effectiveness of our extended formulations for mixed integer programming and the 1-norm regularized soft margin optimization tasks over synthetic and real datasets..Eligible for best student paper.作者: Mhc-Molecule 時間: 2025-3-30 12:16 作者: painkillers 時間: 2025-3-30 14:36
Greedy Gray Codes for?Dyck Words and?Ballot Sequenceseedy algorithm to produce the first known homogeneous 2-Gray code for ballot sequences, which are Dyck prefixes of all weights. Our work extends a previous result on combinations by Williams [Conference proceedings: Workshop on Algorithms and Data Structures (WADS), LNTCS 8037:525-536, 2013].作者: 煩擾 時間: 2025-3-30 20:37
Improved Bounds for?the?Binary Paint Shop Problem. We show that the recursive greedy heuristics is not optimal by providing a tiny improvement. We also introduce a new heuristics, recursive star greedy, that a preliminary analysis shows to be 10% better.作者: Alpha-Cells 時間: 2025-3-30 22:25
0302-9743 owing topical sections:.Part I : Combinatorics and Algorithms; Algorithmic Solution in Applications; and Algorithm in Networks..Part II: Complexity and Approximation; Graph Algorithms; and Applied Algorithms..978-3-031-49192-4978-3-031-49193-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 細微的差異 時間: 2025-3-31 03:25
Aesthetic Judgment: The Legacy of Kant SUSPs can. We construct, by computer search, larger SUSPs than known for small width. This, combined with our tighter analysis, strengthens the upper bound on . from 2.66 to 2.505 obtainable via this computational approach, nearing the handcrafted constructions of Cohn-Umans.作者: 宮殿般 時間: 2025-3-31 05:00 作者: DOLT 時間: 2025-3-31 09:42
https://doi.org/10.1007/978-1-4020-5638-3e two problems allow kernels of 3. vertices, improving all previous results. A significant contribution of our work is the utilization of a novel discharging method for analyzing kernel size, which exhibits potential for analyzing other kernel algorithms.作者: genesis 時間: 2025-3-31 14:34 作者: 偽書 時間: 2025-3-31 20:03
Art as a Synthesis of Form and Expression bound is tight. But, obtaining a sub-quadratic time algorithm for computing the beacon kernel of simple polygons remained open. In this paper, we answer to this open problem by presenting an . time algorithm for computing the beacon kernel of simple polygons.
