Výsledky vyhledávání - "Deterministic algorithm"

Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint Autor Buchbinder, Niv, Feldman, Moran

“… 0.5008-approximation deterministic algorithm, and in fact, shows that there is no separation between the approximation guarantees that can be obtained by deterministic and randomized algorithms for the problem considered…”
Získat plný text

A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint Autor Amanatidis, Georgios, Birmpas, Georgios, Markakis, Evangelos

“… Although there exist randomized algorithms with better expected performance, our algorithm achieves the best known factor achieved by a deterministic algorithm, improving on the previously known factor of 6…”
Získat plný text

A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice Autor Gong, Suning, Nong, Qingqin, Bao, Shuyu, Fang, Qizhi, Du, Ding-Zhu

“…We consider a knapsack-constrained maximization problem of a nonnegative monotone DR-submodular function f over a bounded integer lattice [ B ] in R + n , max…”
Získat plný text

Efficient deterministic algorithms for maximizing symmetric submodular functions Autor Wan, Zongqi, Zhang, Jialin, Sun, Xiaoming, Zhang, Zhijie

“… It, therefore, suffers from high query complexity and is inherently randomized. In this paper, we present several efficient deterministic algorithms for maximizing a symmetric submodular function under various constraints…”
Získat plný text

Byzantine gathering in polynomial time Autor Bouchard, Sébastien, Dieudonné, Yoann, Lamani, Anissa

“…Gathering is a key task in distributed and mobile systems, which becomes significantly harder if some agents are subject to Byzantine faults, known as being the worst ones…”
Získat plný text

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint Autor Buchbinder, Niv, Feldman, Moran

“… Our algorithm vastly improves over the previous state-of-the-art \(0.5008\)-approximation deterministic algorithm, and in fact, shows that there is…”
Získat plný text

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization Autor Buchbinder, Niv, Feldman, Moran

“…Maximization of submodular functions under various constraints is a fundamental problem that has been studied extensively. A powerful technique that has…”
Získat plný text

Deterministic gathering with crash faults Autor Pelc, Andrzej

“… This problem is known as gathering. We study deterministic gathering algorithms under the assumption that agents are subject to crash faults which can occur at any time…”
Získat plný text

Rendezvous in networks in spite of delay faults Autor Chalopin, Jérémie, Dieudonné, Yoann, Labourel, Arnaud, Pelc, Andrzej

“… Agents move in synchronous rounds using a deterministic algorithm. Each agent has a different label, which it can use in the execution of the algorithm, but it does not know the label of the other…”
Získat plný text

Numerical algorithms for personalized search in self-organizing information networks Autor Kamvar, Sep, Kamvar, Sep

“…This book lays out the theoretical groundwork for personalized search and reputation management, both on the Web and in peer-to-peer and social networks…”
Získat plný text

A note on fast deterministic algorithms for non-monotone submodular maximization under a knapsack constraint Autor Lu, Cheng

“… As a result, we obtain the fastest deterministic algorithm so far which achieves an approximation ratio of 1/4 for the problem…”
Získat plný text

Fast deterministic algorithms for non-submodular maximization with strong performance guarantees Autor Lu, Cheng, Yang, Wenguo

“… By adapting the Threshold-Greedy algorithm for the submodular maximization, we present two deterministic algorithms for approximately solving the non-submodular maximization problem…”
Získat plný text

Estimation of Gait Parameters for Transfemoral Amputees Using Lower Limb Kinematics and Deterministic Algorithms Autor Aftab, Zohaib, Ahmed, Gulraiz, Ali, Asad, Gillani, Nazia

“… An open data set containing marker data of 12 subjects with unilateral transfemoral amputation during treadmill walking was used, containing around 3400 gait cycles…”
Získat plný text

Atlas‐guided brain projection tracts: From regions of interest to tractography 3D rendering Autor Dauleac, Corentin, Mertens, Patrick, Frindel, Carole, Jacquesson, Timothée, Cotton, François

“…‐nine healthy subjects were included in this prospective study. Brain DTI was acquired using the same 3…”
Získat plný text

Anomalous White Matter Morphology in Adults Who Stutter Autor Cieslak, Matthew, Ingham, Roger J., Ingham, Janis C., Grafton, Scott T.

“… WM was exhaustively searched using a deterministic algorithm that identifies missing or largely misshapen tracts…”
Získat plný text

Ipsilateral and contralateral cerebro-cerebellar white matter connections: A diffusion tensor imaging study in healthy adults Autor Karavasilis, Efstratios, Christidi, Foteini, Velonakis, Georgios, Giavri, Zoi, Kelekis, Nikolaos L., Efstathopoulos, Efstathios P., Evdokimidis, Ioannis, Dellatolas, Georges

“…: The cerebellum has a pivotal role in regulating human behavior; yet whether this function is mediated only through contralateral cerebro-cerebellar pathways…”
Získat plný text

Distributed computing in the asynchronous LOCAL model Autor Delporte-Gallet, Carole, Fauconnier, Hugues, Fraigniaud, Pierre, Rabie, Mikaël

“…), if T is solvable in t rounds by a deterministic algorithm in the LOCAL model, then T remains solvable by a deterministic algorithm in O…”
Získat plný text

Optimization Techniques in the Localization Problem: A Survey on Recent Advances Autor Stefanoni, Massimo, Sarcevic, Peter, Sárosi, József, Odry, Akos

“… presented. In the first part of this article, the optimization problem is presented by considering the subject from a purely theoretical point of view and both single objective…”
Získat plný text

A new greedy strategy for maximizing monotone submodular function under a cardinality constraint Autor Lu, Cheng, Yang, Wenguo, Gao, Suixiang

“… + subject to a cardinality constraint, i.e., max { f ( A ) : | A | ≤ k , A ⊆ Ω } . We propose a deterministic algorithm based on a new greedy strategy for solving this problem…”
Získat plný text

Cost-Effectiveness and Budget Impact of Obesity Surgery in Patients With Type-2 Diabetes in Three European Countries Autor Ackroyd, Roger, Mouiel, Jean, Chevallier, Jean-Marc, Daoud, Frederic

“… A deterministic algorithm with cost and utility discounting, enabled selection of inputs independently throughout the time scope for each…”
Získat plný text