Search Results - "approximate algorithm"

Mhorseshoe package in R: Approximate algorithm for the horseshoe prior in Bayesian linear model

Authors: Mingi Kang Kyoungjae Lee

Source: SoftwareX, Vol 31, Iss, Pp 102236-(2025)

Subject Terms: QA76.75-76.765, Bayesian inference, Horseshoe prior, Approximate algorithm, Computer software

Access URL: https://doaj.org/article/6d8931a847524f7498d80aec38efbf36

An Approximate Algorithm for Sparse Distributionally Robust Optimization

Authors: Ruyu Wang Yaozhong Hu Cong Liu et al.

Source: Information, Vol 16, Iss 8, p 676 (2025)

Subject Terms: approximate algorithm, sparse optimization, distributionally robust optimization (DRO), portfolio selection, Conditional Value-at-Risk (CVaR), Information technology, T58.5-58.64

File Description: electronic resource

Relation: https://www.mdpi.com/2078-2489/16/8/676; https://doaj.org/toc/2078-2489

Access URL: https://doaj.org/article/0fba8e0bc4f54c1cb0438a6919fa7e25

Small Candidate Set for Translational Pattern Search

Authors: Ziyun Huang Qilong Feng Jianxin Wang et al.

Contributors: Ziyun Huang Qilong Feng Jianxin Wang et al.

Source: Algorithmica. 84:3034-3053

Subject Terms: Bipartite matching, Approximate algorithm, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, ddc:004, 01 natural sciences, Alignment, Discretization

File Description: application/pdf

Access URL: https://dblp.uni-trier.de/db/conf/isaac/isaac2019.html#HuangFW019
https://drops.dagstuhl.de/opus/volltexte/2019/11522/pdf/LIPIcs-ISAAC-2019-26.pdf/
https://pennstate.pure.elsevier.com/en/publications/small-candidate-set-for-translational-pattern-search
https://drops.dagstuhl.de/opus/volltexte/2019/11522/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.26

LEAF: Let’s Efficiently Make Adaptive Forwarding in Payment Channel Networks

Authors: Xiaofei Luo Peng Li

Source: IEEE Access, Vol 11, Pp 4194-4206 (2023)

Subject Terms: Blockchain, payment channel network, multi-paths routing, Markov approximate algorithm, Electrical engineering. Electronics. Nuclear engineering, TK1-9971

File Description: electronic resource

Relation: https://ieeexplore.ieee.org/document/10013657/; https://doaj.org/toc/2169-3536

Access URL: https://doaj.org/article/f4c7fbcf2f094ceb9338126b9930c40a

Bunkering policies for a fuel bunker management problem for liner shipping networks

Authors: Arijit De Alok Choudhary Metin Turkay et al.

Source: De, A, Choudhary, A, Turkay, M & Tiwari, M K 2021, 'Bunkering policies for a fuel bunker management problem for liner shipping networks', European Journal of Operational Research, vol. 289, no. 3, pp. 927-939. https://doi.org/10.1016/j.ejor.2019.07.044

Subject Terms: Bunker fuel management, 0502 economics and business, 05 social sciences, Approximate algorithm, 0211 other engineering and technologies, Heuristics, 02 engineering and technology, Liner shipping, 7. Clean energy, Bunkering policies

File Description: application/pdf

Access URL: https://repository.lboro.ac.uk/articles/journal_contribution/Bunkering_policies_for_a_fuel_bunker_management_problem_for_liner_shipping_networks/9033818/1/files/16525904.pdf
https://www.research.manchester.ac.uk/portal/en/publications/bunkering-policies-for-a-fuel-bunker-management-problem-for-liner-shipping-networks(fd17dc49-add0-4109-beaf-d1f422129c38).html
https://eprints.ncl.ac.uk/258964
http://www.sciencedirect.com/science/article/pii/S037722171930623X
https://repository.lboro.ac.uk/articles/journal_contribution/Bunkering_policies_for_a_fuel_bunker_management_problem_for_liner_shipping_networks/9033818
https://eprint.ncl.ac.uk/258964
https://research.nitie.ac.in/publication/bunkering-policies-for-a-fuel-bunker-management

Deterministic Approximate Methods for Maximum Consensus Robust Fitting

Authors: Le, Huu Chin, Tat Jun Eriksson, Anders et al.

Source: IEEE Transactions on Pattern Analysis and Machine Intelligence. 43(3):842-857

Subject Terms: Maximum consensus, deterministic algorithm, approximate algorithm, robust fitting

Access URL: https://research.chalmers.se/publication/522416

An approximate algorithm for maximizing modularity by estimating the domain of influence

Authors: Seyfollah Soleimani Rouhollah Javadpour Boroujeni

Source: هوش محاسباتی در مهندسی برق, Vol 13, Iss 3, Pp 87-100 (2022)

Subject Terms: approximate algorithm, community detection, reverse influence sampling (ris) framework, social networks, influential nodes, modularity, Electronic computers. Computer science, QA75.5-76.95

File Description: electronic resource

Relation: https://isee.ui.ac.ir/article_25856_ab9d50db732166f473b9918d5624c22c.pdf; https://doaj.org/toc/2821-0689

Access URL: https://doaj.org/article/cdd78fb287ca464281e85401b9b6f76d

A New Quadratic Matrix Inequality Approach to Robust Adaptive Beamforming for General-rank Signal Model

Authors: Huang, Y. Vorobyov, Sergiy Luo et al.

Source: ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). :4335-4339

Subject Terms: deterministic approximate algorithm, Robust adaptive beamforming, ta213, quadratic matrix inequality problem, 0202 electrical engineering, electronic engineering, information engineering, general-rank signal model, 02 engineering and technology, linear matrix inequality relaxation

Access URL: http://juuli.fi/Record/0339563419
https://doi.org/10.1109/ICASSP.2019.8683645
https://dblp.uni-trier.de/db/conf/icassp/icassp2019.html#HuangVL19
https://ieeexplore.ieee.org/document/8683645
https://experts.umn.edu/en/publications/a-new-quadratic-matrix-inequality-approach-to-robust-adaptive-bea
http://dblp.uni-trier.de/db/conf/icassp/icassp2019.html#HuangVL19
https://research.aalto.fi/en/publications/a-new-quadratic-matrix-inequality-approach-to-robust-adaptive-beamforming-for-generalrank-signal-model(57cfc9fe-8a6a-4aeb-a417-329fdea29612).html

An experimental analysis on the similarity of argumentation semantics

Authors: Cerutti F. Thimm M. Vallati M.

Source: Argument & Computation, Vol 11, Iss 3, Pp 269-304 (2020)

Subject Terms: 0301 basic medicine, 03 medical and health sciences, Electronic computers. Computer science, Computational linguistics. Natural language processing, 0202 electrical engineering, electronic engineering, information engineering, QA75.5-76.95, 02 engineering and technology, P98-98.5, Approximate algorithm, experimental analysis, Jaccard's distance

File Description: application/pdf

Access URL: https://iris.unibs.it/bitstream/11379/538436/1/fcmtmv_exparg.pdf
https://doaj.org/article/3fc2ff56b35f4927baa7bf7aed6ccb4a
https://pure.hud.ac.uk/en/publications/an-experimental-analysis-on-the-similarity-of-argumentation-seman
https://content.iospress.com/articles/argument-and-computation/aac200907

Quadratic Matrix Inequality Approach to Robust Adaptive Beamforming for General-Rank Signal Model

Authors: Huang, Yongwei Vorobyov, Sergiy A. Luo et al.

Source: IEEE Transactions on Signal Processing. 68:2244-2255

Subject Terms: linear matrix inequality (LMI) relaxation, Signal Processing (eess.SP), quadratic matrix inequality (QMI) problem, Robust adaptive beamforming, ta213, approximate algorithm, FOS: Electrical engineering, electronic engineering, information engineering, 0202 electrical engineering, electronic engineering, information engineering, general-rank signal model, 02 engineering and technology, Electrical Engineering and Systems Science - Signal Processing, global optimality condition

Access URL: http://arxiv.org/pdf/1905.10519
http://arxiv.org/abs/1905.10519
http://juuli.fi/Record/0368052320
https://doi.org/10.1109/TSP.2020.2981208
https://ieeexplore.ieee.org/document/9040677
https://arxiv.org/abs/1905.10519
http://arxiv.org/pdf/1905.10519.pdf
https://ui.adsabs.harvard.edu/abs/2020ITSP...68.2244H/abstract
http://ieeexplore.ieee.org/document/9040677
https://dblp.uni-trier.de/db/journals/tsp/tsp68.html#HuangVL20

Research on Distribution Optimization of Emergency Perishable Materials Considering Periodic Changes in Freshness

Authors: Zichun Zhang Yang Xu Xiaodong Li et al.

Source: Mathematics, Vol 11, Iss 9, p 2067 (2023)

Subject Terms: emergency perishable materials, freshness, vehicle distribution optimization, approximate algorithm, Mathematics, QA1-939

Relation: https://www.mdpi.com/2227-7390/11/9/2067; https://doaj.org/toc/2227-7390; https://doaj.org/article/b4b7ef33e7dc45e1a51ad87cbf5d6346

Availability: https://doi.org/10.3390/math11092067
https://doaj.org/article/b4b7ef33e7dc45e1a51ad87cbf5d6346

Inapproximability of counting independent sets in linear hypergraphs

Authors: Qiu, Guoliang Wang, Jiaheng

Source: Qiu, G & Wang, J 2023, ' Inapproximability of Counting Independent Sets in Linear Hypergraphs ', Information Processing Letters, vol. 184, no. February 2024, 106448, pp. 1-6 . https://doi.org/10.1016/j.ipl.2023.106448
Information Processing Letters

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), approximate algorithm, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Approximate counting, Hypergraph independent set, Linear hypergraph, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0101 mathematics, Inapproximability, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2212.03072
https://hdl.handle.net/20.500.11820/11dd5f16-3682-4c9a-9bc4-0320bb720b1d
https://www.pure.ed.ac.uk/ws/files/383675731/Inapproximability_of_counting_QUI_DOA24092023_VOR_CC_BY.pdf

Bus Frequency Optimization: When Waiting Time Matters in User Satisfaction

Authors: MO, Songsong BAO, Zhifeng ZHENG, Baihua et al.

Source: Lecture Notes in Computer Science ISBN: 9783030594152

Subject Terms: Social and Information Networks (cs.SI), Signal Processing (eess.SP), FOS: Computer and information sciences, Operations Research, Artificial Intelligence and Robotics, approximate algorithm, 05 social sciences, Transportation, Computer Science - Social and Information Networks, Databases (cs.DB), 02 engineering and technology, bus frequency scheduling optimization, user waiting time minimization, Systems Engineering and Industrial Engineering, Computer Science - Databases, 0502 economics and business, 11. Sustainability, 0202 electrical engineering, electronic engineering, information engineering, FOS: Electrical engineering, electronic engineering, information engineering, Electrical Engineering and Systems Science - Signal Processing

File Description: application/pdf

Access URL: https://ink.library.smu.edu.sg/sis_research/5314
http://arxiv.org/abs/2004.07812
https://arxiv.org/abs/2004.07812
http://ui.adsabs.harvard.edu/abs/2020arXiv200407812M/abstract
https://arxiv.org/pdf/2004.07812.pdf
https://dblp.uni-trier.de/db/journals/corr/corr2004.html#abs-2004-07812
https://ink.library.smu.edu.sg/sis_research/5314/
https://arxiv.org/abs/2004.07812
https://link.springer.com/chapter/10.1007/978-3-030-59416-9_12
https://ink.library.smu.edu.sg/cgi/viewcontent.cgi?article=6317&context=sis_research
https://rd.springer.com/chapter/10.1007/978-3-030-59416-9_12

An Analytic Model for Capacity Planning of Prisons in the Netherlands

Authors: Korporaal, R. Ridder, A. Kloprogge, P. et al.

Source: The Journal of the Operational Research Society, 2000 Nov 01. 51(11), 1228-1237.

Access URL: https://www.jstor.org/stable/254208

Exploring the Landscape of Big Data Analytics Through Domain-Aware Algorithm Design

Authors: Dash, Sajal

Thesis Advisors: Computer Science, Feng, Wu-chun, Anandakrishnan, Ramamoorthy, Leman, Scotland C., Raghvendra, Sharath, North, Christopher L.

Subject Terms: Big data analytics, High-performance computing, Algorithmic machine learning, Incremental algorithm, Approximate algorithm

File Description: ETD; application/pdf; application/vnd.openxmlformats-officedocument.spreadsheetml.sheet

Availability: http://hdl.handle.net/10919/99798

Fast density clustering strategies based on the k-means algorithm

Authors: Huawei Shen Jiye Liang Yike Guo et al.

Source: Pattern Recognition. 71:375-386

Subject Terms: Acceleration mechanism, Cluster analysis, Approximate algorithm, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, K-means, Density-based clustering

Access URL: https://www.sciencedirect.com/science/article/pii/S0031320317302455
http://www.sciencedirect.com/science/article/pii/S0031320317302455
https://dblp.uni-trier.de/db/journals/pr/pr71.html#BaiCLSG17

Finding events in temporal networks: segmentation meets densest subgraph discovery

Authors: Polina Rozenshtein Francesco Bonchi Aristides Gionis et al.

Contributors: Polina Rozenshtein Francesco Bonchi Aristides Gionis et al.

Subject Terms: Densest subgraph, Segmentation, Dynamic programming, Approximate algorithm

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001453571100001; volume:62; issue:4; firstpage:1611; lastpage:1639; numberofpages:29; journal:KNOWLEDGE AND INFORMATION SYSTEMS; https://hdl.handle.net/11385/251381

Availability: https://hdl.handle.net/11385/251381
https://doi.org/10.1007/s10115-019-01403-9
https://link.springer.com/article/10.1007/s10115-019-01403-9

Finding Events in Temporal Networks: Segmentation Meets Densest-Subgraph Discovery

Authors: Aristides Gionis Nikolaj Tatti Polina Rozenshtein et al.

Contributors: Aristides Gionis Nikolaj Tatti Polina Rozenshtein et al.

Source: 2018 IEEE International Conference on Data Mining (ICDM)

Subject Terms: ta113, Social and Information Networks (cs.SI), FOS: Computer and information sciences, 0301 basic medicine, Densest subgraph, Segmentation, Dynamic programming, Approximate algorithm, Computer and information sciences, Densest subgraph, Approximate algorithm, Computer Science - Social and Information Networks, 02 engineering and technology, Dynamic programming, 03 medical and health sciences, Segmentation, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS)

File Description: application/pdf

Access URL: https://helda.helsinki.fi/bitstream/10138/326234/1/Rozenshtein2019_Article_FindingEventsInTemporalNetwork.pdf
https://link.springer.com/content/pdf/10.1007/s10115-019-01403-9.pdf
http://arxiv.org/abs/1808.09317
http://juuli.fi/Record/0362063719
https://doi.org/10.1007/s10115019014039
http://juuli.fi/Record/0333795318
https://doi.org/10.1109/ICDM.2018.00055
https://dblp.uni-trier.de/db/conf/icdm/icdm2018.html#RozenshteinBGST18
https://link.springer.com/article/10.1007%2Fs10115-019-01403-9
https://researchportal.helsinki.fi/sv/publications/finding-events-in-temporal-networks-segmentation-meets-densest-su
http://ui.adsabs.harvard.edu/abs/2018arXiv180809317R/abstract
https://link.springer.com/article/10.1007/s10115-019-01403-9
https://dblp.uni-trier.de/db/journals/kais/kais62.html#RozenshteinBGST20
https://doi.org/10.1007/s10115-019-01403-9
https://link.springer.com/content/pdf/10.1007/s10115-019-01403-9.pdf
https://aaltodoc.aalto.fi:443/handle/123456789/42102
https://research.aalto.fi/files/38662289/Rozenshtein2019_Article_FindingEventsInTemporalNetwork.pdf
http://hdl.handle.net/10138/326234
https://aaltodoc.aalto.fi/handle/123456789/42102

FRAIM:a feature importance-aware incentive mechanism for vertical federated learning

Authors: Tan, Lei Yang, Yunchao Hu, Miao et al.

Contributors: Tan, Lei Yang, Yunchao Hu, Miao et al.

Source: Tan , L , Yang , Y , Hu , M , Zhou , Y & Wu , D 2024 , FRAIM : a feature importance-aware incentive mechanism for vertical federated learning . in Z Tari , K Li & H Wu (eds) , Algorithms and Architectures for Parallel Processing : 23rd International Conference, ICA3PP 2023, Tianjin, China, October 20–22, 2023, proceedings, part V . Lecture Notes in Computer Science , vol. 14491 , Springer, Springer Nature , Singapore , pp. 132-150 , International Conference on Algorithms and Architectures for Parallel Processing (23rd : 2023) , Tianjin , China ....

Subject Terms: Vertical federated learning, Incentive mechanism, Feature importance, Reverse auction, Approximate algorithm

Relation: urn:ISBN:9789819708079

Availability: https://researchers.mq.edu.au/en/publications/67811b82-dbe5-476b-97f1-4488df3412f3
https://doi.org/10.1007/978-981-97-0808-6_8
http://www.scopus.com/inward/record.url?scp=85187641307&partnerID=8YFLogxK

Finding shortest gentle paths on polyhedral terrains by the method of multiple shooting

Authors: Phan Thanh An Nguyen Thi Le Le Hong Trang et al.

Source: Journal of Computational Science. 67:101935

Subject Terms: Method of multiple shooting, Shortest path, Approximate algorithm, Motion planning, Straightest geodesic, 0102 computer and information sciences, Shortest gentle path, 0101 mathematics, 01 natural sciences, Geometric path constraints