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

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

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

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

Deterministic Algorithms for Submodular Maximization Problems Autor Buchbinder, Niv, Feldman, Moran

“… the approximation ratios obtained by current randomized algorithms are superior to the best results obtained by known deterministic algorithms…”
Získat plný text

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

Computer Aided Design Automation of Low Power, Low Voltage Four Quadrant Transconductance Multiplier Autor Mishra, B.K., Save, S.

“… where as when it comes to AMS design it is still a fancy. The CMOS multipliers implementation is still a challenging subject especially for low voltage and low power circuit…”
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

Synthesis of Orbital Angular Momentum Antennas for Target Localization Autor Battaglia, Giada M., Isernia, Tommaso, Palmeri, Roberta, Morabito, Andrea F.

“…The exploitation of Orbital Angular Momentum (OAM) is proposed to design circular‐support continuous aperture distributions and concentric‐ring arrays for…”
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

Multimodal cross‐examination of progressive apraxia of speech by diffusion tensor imaging‐based tractography and Tau‐PET scans Autor Gatto, Rodolfo G., Pham, Nha Trang Thu, Duffy, Joseph R., Clark, Heather M., Utianski, Rene L., Botha, Hugo, Machulda, Mary M., Lowe, Val J., Schwarz, Christopher G., Jack, Clifford R., Josephs, Keith A., Whitwell, Jennifer L.

“…Progressive apraxia of speech (PAOS) is a 4R tauopathy characterized by difficulties with motor speech planning. Neurodegeneration in PAOS targets the premotor…”
Získat plný text

Memory and communication efficient algorithm for decentralized counting of nodes in networks Autor Saha, Arindam, Marshall, James A. R., Reina, Andreagiovanni

“…, such as collective robotics and distributed sensor networks. Thus several stochastic and naïve deterministic algorithms for distributed graph size estimation or calculation have been provided…”
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

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

A general global-local modelling framework for the deterministic optimisation of composite structures Autor Scardaoni, Marco Picchi, Montemurro, Marco

“…This work deals with the multi-scale optimisation of composite structures by adopting a general global-local (GL) modelling strategy to assess the structure…”
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

On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan Autor Ridouard, Frédéric, Richard, Pascal, Martineau, Patrick

“… This general problem with infinite machine capacity is noted 1∣ p − batch, r j , b = ∞∣ C max. Deterministic algorithms that do not…”
Získat plný text