489 Hits in 14.4 sec

Weighted sum-rate maximization for a set of interfering links via branch and bound

P. C. Weeraddana, M. Codreanu, M. Latva-aho, A. Ephremides
2010 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers  
It plays a central role in resource allocation, link scheduling or in finding achievable rate regions for both wireline and wireless networks. This problem is known to be NP-hard.  ...  We consider the problem of weighted sum-rate maximization (WSRMax) for a set of interfering links.  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers for their comments which have improved the presentation and the quality of the paper.  ... 
doi:10.1109/acssc.2010.5757868 fatcat:qmd3sd63zzdtjazy3dozteuegm

Weighted Sum-Rate Maximization for a Set of Interfering Links via Branch and Bound

Pradeep Chathuranga Weeraddana, Marian Codreanu, Matti Latva-aho, Anthony Ephremides
2011 IEEE Transactions on Signal Processing  
It plays a central role in resource allocation, link scheduling or in finding achievable rate regions for both wireline and wireless networks. This problem is known to be NP-hard.  ...  We consider the problem of weighted sum-rate maximization (WSRMax) for a set of interfering links.  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers for their comments which have improved the presentation and the quality of the paper.  ... 
doi:10.1109/tsp.2011.2152397 fatcat:tieghvjcxfblxn6q2num3nkj54

Weighted Sum-Rate Maximization in Wireless Networks: A Review

Pradeep Chathuranga Weeraddana
2011 Foundations and Trends® in Networking  
Acknowledgments The work of P.C. Weeraddana  ...  Problem (B.1) is a convex optimization problem [22] , and therefore can be solved efficiently.  ...  GPs can be reformulated as convex problems and they can be solved very efficiently, even for large scale problems [20, sec. 2.5].  ... 
doi:10.1561/1300000036 fatcat:254zyltt4je6jlkonwxhj36l5a

Hybrid Approaches to Address Various Challenges in Wireless Sensor Network for IoT Applications: Opportunities and Open Problems

Pallavi Joshi, Ajay Singh Raghuvanshi
2021 International Journal of Computer Networks And Applications  
The paper covers literature centered on various technologies, schemes, and algorithms to address many problems coming in the way of coming-of-age wireless communication technologies for various applications  ...  But machine learning approaches also cannot solve all the problems in WSN solely.  ...  These problems are universal NP-hard and to solve them an efficient mathematical model has to be designed.  ... 
doi:10.22247/ijcna/2021/209186 fatcat:isjbrui3wjb6bcj5ifyzt6jboi

SkyHaul: An Autonomous Gigabit Network Fabric in the Sky [article]

Ramanujan K Sheshadri, Eugene Chai, Karthikeyan Sundaresan, Sampath Rangarajan
2020 arXiv   pre-print
that simultaneously address application tracking and backhaul connectivity (2) Novel algorithms to jointly address the problem of deployment (position, yaw of UAVs) and traffic routing across the UAV  ...  network; and (3) A provably optimal solution for fast and safe reconfiguration of UAV backhaul during application dynamics.  ...  Novel algorithm for efficient positioning, orientation and traffic routing across UAVs.  ... 
arXiv:2006.11307v1 fatcat:f6vh65durferhcuahpc6s53gde

Structured Prediction Problem Archive [article]

Paul Swoboda, Andrea Hornakova, Paul Roetzer, Bogdan Savchynskyy, Ahmed Abbas
2022 arXiv   pre-print
We provide archival links to datasets, description of the considered problems and problem formats, and a short summary of problem characteristics including size, number of instances etc.  ...  In order to facilitate algorithm development for their numerical solution, we collect in one place a large number of datasets in easy to read formats for a diverse set of problem classes.  ...  Path following [ZBV08]: A convex-concave programming formulation obtained by rewriting graph matching as a least-squares problem on the set of permutation matrices and solving a quadratic convex and concave  ... 
arXiv:2202.03574v2 fatcat:n5ez3attlveyvamyz5l4sdgozi

Global Reconfiguration of a Team of Networked Mobile Robots Among Obstacles [chapter]

Robert Fitch, Alen Alempijevic, Thierry Peynot
2015 Advances in Intelligent Systems and Computing  
The approach is designed to be resource-efficient and we show experiments using a team of nine mobile robots with modest computation, communication, and sensing.  ...  We present a novel two-layer planning and control algorithm for team reconfiguration that is decentralised and assumes local (neighbour-to-neighbour) communication only.  ...  Acknowledgments This work was supported in part by the Australian Centre for Field Robotics (ACFR) and the NSW State Government.  ... 
doi:10.1007/978-3-319-08338-4_47 fatcat:fs7dep4gcvdz3novbc77i2mxjm

Tracking Multiple Indistinguishable and Deformable Objects Based on Multi-Anchor Flow with Annular Sector Model

Biao Guo, Yuesheng Zhu
2019 IEEE Access  
The results demonstrate that the proposed method has better performance on both of the accuracy of identity assignment and the computational time when compared to other multi-object tracking algorithms  ...  Most of current multi-object tracking (MOT) methods solve the task of identity assignment mainly by using the distinguishable features and predictable motions of nearly rigid objects.  ...  However, the computational efficiency of this work should be further improved and the drifting problem in some cases should be solved.  ... 
doi:10.1109/access.2019.2952598 fatcat:7gc4rdfnwre5rf7htdkarfaqsi

2018 Index IEEE Transactions on Automatic Control Vol. 63

2018 IEEE Transactions on Automatic Control  
., +, TAC Nov. 2018 3719-3734 Bipartite graph A Flow-Network-Based Polynomial-Time Approximation Algorithm for the Minimum Constrained Input Structural Controllability Problem.  ...  ., +, TAC May 2018 1434-1441 Distributed Algorithm for Solving Convex Inequalities.  ... 
doi:10.1109/tac.2019.2896796 fatcat:bwmqasulnzbwhin5hv4547ypfe

Reformulation and convex relaxation techniques for global optimization

Leo Liberti
2004 4OR  
All sBB algorithms rely on the construction of a convex relaxation of the original NLP problem. Relatively tight convex relaxations are known for many categories of algebraic expressions.  ...  Numerical results illustrating the beneficial effects of applying such automatic reformulations to the well-known pooling and blending problem are presented.  ...  The problem of reducing quadratic forms is tightly linked to the problem of diagonalizing a square matrix. Let and is diagonal.  ... 
doi:10.1007/s10288-004-0038-6 fatcat:h7ahszha7fbinnuj5zrpoa4jgm

Wireless Backhaul in 5G and Beyond: Issues, Challenges and Opportunities [article]

Berke Tezergil, Ertan Onur
2021 arXiv   pre-print
Resource allocation, deployment, scheduling, power management and energy efficiency are some of these problems.  ...  ), and beamforming, wireless backhaul is expected to be an integral part of the 5G networks.  ...  Then, the problem of sub-channel allocation and user association at terrestrial backhaul and radio access links is formulated as a maximum weighted bipartite matching problem and solved using the Hungarian  ... 
arXiv:2103.08234v2 fatcat:3fug6wsmtrg5bfxk2ga2f2al5i

Linear Assignment Problems and Extensions [chapter]

Rainer E. Burkard, Eranda Çela
1999 Handbook of Combinatorial Optimization  
Finally, planar and axial three-dimensional assignment problems are considered, and polyhedral results, as well as algorithms for these problems or their special cases are discussed.  ...  algorithms, parallel approaches, and the asymptotic behaviour.  ...  The maximum matching problem is particularly easy to solve in so-called convex bipartite graphs (Glover [89] ).  ... 
doi:10.1007/978-1-4757-3023-4_2 fatcat:zb3oagbemfg23l57jxd6d6vna4

A Survey of Rate-optimal Power Domain NOMA with Enabling Technologies of Future Wireless Networks [article]

Omar Maraqa, Aditya S. Rajasekaran
2020 arXiv   pre-print
In this way, NOMA schemes tend to offer several advantages over OMA schemes such as improved user fairness and spectral efficiency, higher cell-edge throughput, massive connectivity support, and low transmission  ...  In this paper, we survey the integration of PD-NOMA with the enabling communications schemes and technologies that are expected to meet the various requirements of B5G networks.  ...  Also, the authors would like to thank Ericsson Canada Inc. and the Discovery Grant of the Natural Sciences and Engineering Research Council of Canada for support.  ... 
arXiv:1909.08011v4 fatcat:xlt7aul75zhozkb2stpbs4q2fm

Min-Max Results in Combinatorial Optimization [chapter]

A. Schrijver
1983 Mathematical Programming The State of the Art  
. , Sk of S such that, for all i = 1, 2 and S' E 'lf;, S' intersects at least g; (S') of the S;)=max{g;(S')li= 1, 2; S'E'IB';} (assuming g;(S')~O for at least one i and S').  ...  This relation implies Konig's and Gupta's edge-colouring theorems (Theorem 3 and Corollary 3 a). Acknowledgements. I thank Dr. W. Cook and Dr. W. R. Pulleyblank for their helpful comments.  ...  out to generalize those for bipartite graphs and network flows.  ... 
doi:10.1007/978-3-642-68874-4_18 dblp:conf/ismp/Schrijver82 fatcat:jnz2kyrjnzfnlpwxbkondscuki

The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping

Berit D. Brouer, Jakob Dirksen, David Pisinger, Christian E.M. Plum, Bo Vaaben
2013 European Journal of Operational Research  
The problem is framed as a multi-indicator assessment and is solved using a minimal cost objective.  ...  Multi-objective (MO) route selection problem is a combination of two combinatorial problems: MO shortest path problem (finding the efficient paths between the nodes to be visited) and MO traveling salesperson  ...  We propose a decomposition along the scenarios and solve the problem by a Branch&Bound-algorithm. Non-convex MINLP are used to model the gas network and solved as subproblem.  ... 
doi:10.1016/j.ejor.2012.08.016 fatcat:c27kagfnxnhjfbil2rydhjhomm
« Previous Showing results 1 — 15 out of 489 results