Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 43 matches
- 2024
- Abdollah Ghaffari Sheshjavani, Ahmad Khonsari, Masoumeh Moradian, Seyed Pooya Shariatpanahi, Seyedeh Bahereh Hassanpour:
Hybrid Coded-Uncoded Caching in Multi-Access Networks with Non-uniform Demands. CoRR abs/2401.07288 (2024) - 2023
- Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont:
Robust capacitated Steiner trees and networks with uniform demands. Networks 82(1): 3-31 (2023) - Behnaz Merikhi, Mohammad Reza Soleymani:
Cache-Aided Networks with Shared Caches and Correlated Content under Non-Uniform Demands. CCNC 2023: 301-304 - Jørgen Bang-Jensen, Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh:
A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands. ESA 2023: 13:1-13:15 - 2022
- Abdollah Ghaffari Sheshjavani, Ahmad Khonsari, Seyed Pooya Shariatpanahi, Masoumeh Moradian, Aresh Dadlani:
Content Caching in Shared Medium Networks with Non-Uniform and User-Dependent Demands. ICC 2022: 2501-2506 - 2021
- Seyed Mahdi Shavarani, Mahmoud Golabi, Gökhan Izbirak:
A capacitated biobjective location problem with uniformly distributed demands in the UAV-supported delivery operation. Int. Trans. Oper. Res. 28(6): 3220-3243 (2021) - Nitin Padmanabhan, Kankar Bhattacharya:
Including Demand Response and Battery Energy Storage Systems in Uniform Marginal Price Based Electricity Markets. ISGT 2021: 1-5 - 2020
- Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal:
Scheduling split intervals with non-uniform demands. Discret. Optim. 38: 100611 (2020) - Lucia Cazabal-Valencia, Santiago Omar Caballero Morales, José Luis Martínez Flores, Damián Emilio Gibaja Romero:
Inventory Model in a CVRP Distribution Network with Uniformly Distributed Demand. Int. J. Comb. Optim. Probl. Informatics 11(2): 75-85 (2020) - Finn Fernstrøm, Teresa Anna Steiner:
A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands. Inf. Process. Lett. 159-160: 105960 (2020) - Mingming Wu, Yue Xiao, Yulan Gao, Ming Xiao:
Dynamic Socially-Motivated D2D Relay Selection With Uniform QoE Criterion for Multi-Demands. IEEE Trans. Commun. 68(6): 3355-3368 (2020) - Eva Lagunas, Mirza Golam Kibria, Hayder Al-Hraishawi, Nicola Maturo, Symeon Chatzinotas:
Dealing with Non-Uniform Demands in Flexible GEO Satellites: The Carrier Aggregation Perspective. ASMS/SPSC 2020: 1-5 - 2019
- Qiang Cai, Chunlin Luo, Xin Tian, Shouyang Wang:
Uniform Pricing Strategy vs. Price Differentiation Strategy in the Presence of Cost Saving and Demand Increasing. J. Syst. Sci. Complex. 32(3): 932-946 (2019) - Michael Yu. Khachay, Yuri Ogorodnikov:
Efficient PTAS for the Euclidean Capacitated Vehicle Routing Problem with Non-uniform Non-splittable Demand. AIST 2019: 388-398 - Michael Yu. Khachay, Yuri Ogorodnikov:
Approximation Scheme for the Capacitated Vehicle Routing Problem with Time Windows and Non-uniform Demand. MOTOR 2019: 309-327 - 2018
- Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms for Survivable Network Design with Uniform Demands. SODA 2018: 2838-2850 - Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont:
Robust capacitated trees and networks with uniform demands. CoRR abs/1801.04696 (2018) - Pierre Quinton, Saeid Sahraei, Michael Gastpar:
A Novel Centralized Strategy for Coded Caching with Non-uniform Demands. CoRR abs/1801.10563 (2018) - 2017
- L. Rajya Lakshmi, Biplab Sikdar:
STDMA scheduling for WLANs and WPANs with non-uniform traffic demand. LANMAN 2017: 1-6 - 2016
- Daniel Hölker, Daniel Brettschneider, Marten Fischer, Ralf Tönjes, Peter Roer:
Quality-functions for an uniform and comparable analysis of demand side management algorithms. Comput. Sci. Res. Dev. 31(1-2): 57-64 (2016) - Sungjin Im, Mina Naghshnejad, Mukesh Singhal:
Scheduling jobs with non-uniform demands on multiple servers without interruption. INFOCOM 2016: 1-9 - Ming Lei, Xiangdong Liu, Haichao Ma:
A uniform pricing and channel selection model with random demand. LISS 2016: 1-6 - 2015
- Sraboni Mandal, Danish Ali Khan:
Integrated inventory model with uniform demand for one vendor one customer. Int. J. Bus. Perform. Supply Chain Model. 7(1): 36-52 (2015) - 2014
- Avik Sengupta, Ravi Tandon, T. Charles Clancy:
Secure caching with non-uniform demands. VITAE 2014: 1-5 - 2013
- Tri Kurniawan Wijaya, Thanasis G. Papaioannou, Xin Liu, Karl Aberer:
Effective consumption scheduling for demand-side management in the smart grid using non-uniform participation rate. SustainIT 2013: 1-8 - 2012
- Francisco J. Arcelus, Satyendra Kumar, Gopalan Srinivasan:
Bicriteria optimization in the newsvendor problem with uniformly distributed demand. 4OR 10(3): 267-286 (2012) - Naoki Katoh, Shin-ichi Tanigawa:
A rooted-forest partition with uniform vertex demand. J. Comb. Optim. 24(2): 67-98 (2012) - 2011
- Oded Berman, Dmitry Krass:
On n-facility median problem with facilities subject to failure facing uniform demand. Discret. Appl. Math. 159(6): 420-432 (2011) - Yasuhito Tanaka, Atsuhiro Satoh:
A Constructive Analysis of Convex-Valued Demand Correspondence for Weakly Uniformly Rotund and Monotonic Preference. Adv. Decis. Sci. 2011: 960819:1-960819:7 (2011) - Michael C. Caramanis, Justin M. Foster:
Uniform and complex bids for demand response and wind generation scheduling in multi-period linked transmission and distribution markets. CDC/ECC 2011: 4340-4347
skipping 13 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-25 04:05 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint