Zobrazeno 1 - 10
of 90
pro vyhledávání: '"Daya Ram Gaur"'
Publikováno v:
Discrete Applied Mathematics. 319:372-381
We characterize the optimal solution to the linear programming relaxation of the standard formulation for the minimum satisfiability problem. We give a O ( n m 2 ) combinatorial algorithm to solve the fractional version of the minimum satisfiability
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83df0b649b5c404e99b55868b016a2c3
https://doi.org/10.1016/j.dam.2021.07.016
https://doi.org/10.1016/j.dam.2021.07.016
Publikováno v:
Discrete Applied Mathematics. 280:133-143
In this paper, we give randomized approximation algorithms for stochastic cumulative VRPs for the split and unsplit deliveries. The approximation ratios are max { 1 + 1 . 5 α , 3 } and 6, respectively, where α is the approximation ratio for the met
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a68d63b7c7b2209855e0fdde779975f2
https://doi.org/10.1016/j.dam.2018.01.012
https://doi.org/10.1016/j.dam.2018.01.012
Publikováno v:
2022 IEEE Wireless Communications and Networking Conference (WCNC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68ce9e2c5040009baeb1e00bc3388b06
https://doi.org/10.1109/wcnc51071.2022.9771796
https://doi.org/10.1109/wcnc51071.2022.9771796
Publikováno v:
In Discrete Applied Mathematics 15 June 2020 280:133-143
Publikováno v:
ICSE (Companion Volume)
We propose a methodology to study and visualize the evolution of the modular structure of a network of functional dependencies in a software system. Our method identifies periods of significant refactoring activities, also known as the evolutionary h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb6077762f1d9b7235796fe4f9c238a3
https://doi.org/10.1145/3377812.3390909
https://doi.org/10.1145/3377812.3390909
Autor:
Daya Ram Gaur, Rishi Ranjan Singh
Publikováno v:
Discrete Applied Mathematics. 228:140-157
Cumulative vehicle routing problems are a simplified model of fuel consumption in vehicle routing problems. Here we computationally study, an inexact approach for constructing solutions to cumulative vehicle routing problems based on rounding solutio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::06f3ef5d88f340e983a23a9fdf5cf608
https://doi.org/10.1016/j.dam.2016.05.030
https://doi.org/10.1016/j.dam.2016.05.030
Autor:
Daya Ram Gaur, N. S. Narayanaswamy
Publikováno v:
Discrete Applied Mathematics. 286:1-2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11a3ea2f686abf9cc889b6d4dd371c49
https://doi.org/10.1016/j.dam.2020.09.001
https://doi.org/10.1016/j.dam.2020.09.001
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030392185
CALDAM
CALDAM
We characterize the optimal solution to the LP relaxation of the standard formulation for the minimum satisfiability problem. Based on the characterization, we give a \(O(nm^2)\) combinatorial algorithm to solve the fractional version of the minimum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d2076d2a125f7e9738a10633fe2683c
https://doi.org/10.1007/978-3-030-39219-2_23
https://doi.org/10.1007/978-3-030-39219-2_23
Publikováno v:
WCNC
Device-to-device (D2D) communication in an underlaying cellular network is becoming increasingly common in telecommunication systems, and it will play a vital role in the fifth generation (5G) and beyond. The base stations manage the cellular users.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::576437336915aa9b1b5f32b4e12e2fc3
https://doi.org/10.1109/wcnc.2019.8886007
https://doi.org/10.1109/wcnc.2019.8886007
Publikováno v:
MSR
Several authors have quantified the modularity of software systems in terms of coupling and cohesion metrics. Most of these approaches focus on functional and procedural dependencies in the system. Although highly relevant at the design phase, these
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7055b6124b3385e5e147a8c12b0ae8fc
https://doi.org/10.1145/3196398.3196409
https://doi.org/10.1145/3196398.3196409