Results 31 to 40 of about 149,503 (282)
A Hybrid Dispatch Strategy Based on the Demand Prediction of Shared Bicycles
Applied Sciences, 2020 With the advent of pile-less shared bicycles, the techniques initially used for public bicycle dispatching were unable to fulfill the routine dispatch tasks, resulting in constant bicycle crowding. In this paper, to alleviate the mess of shared bicycles,
Shu Shen +4 more
doaj +1 more source
A heuristic algorithm for the container loading problem with complex loading constraints
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2016 In this paper, we propose a heuristic algorithm for a container loading problem for logistic platforms, which is the problem for the Challenge Renault/ESICUP 2015.
Hiroki IWASAWA +4 more
doaj +1 more source
Lifetime maximization for greedy selective relay strategies
Exhibition, 2009 In this paper we propose a new algorithm for selective relay strategies with Amplify-and-Forward (AF) relays which improves the relay network lifetime. The lifetime of the relay network is defined as the maximum number of messages which can be received with the desired SNR at the destination while the system Probability of Outage (P-outage) requirement
Mousavifar, S.A., Leung, C., Khattab, T.
openaire +2 more sources
Dynamic mutation enhanced greedy strategy for wavefront shaping
, 2022 Optical focusing through scattering media has important implications for optical applications in medicine, communications, and detection. In recent years, many wavefront shaping methods have been successfully applied to the field, among which the population optimization algorithm has achieved remarkable results.
Zhang, Chuncheng +7 more
openaire +2 more sources
工程科学学报, 2017 The billet design problem (BDP) in seamless steel tube production is to assign order tubes to billets under process constraints. Because of the batch rule in practical production, each order has a minimum weight of tubes assigned to any billet. Meanwhile,
LI Tie-ke +3 more
doaj +1 more source
Mixing Greedy and Evolutive Approaches to Improve Pursuit Strategies [PDF]
, 2009 The prey-predator pursuit problem is a generic multi-agent testbed referenced many times in literature. Algorithms and conclusions obtained in this domain can be extended and applied to many particular problems. In first place, greedy algorithms seem to do the job.
Reverte Bernabeu, Juan +3 more
openaire +2 more sources
Euclidean Greedy Drawings of Trees
, 2013 Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each source-destination pair of nodes s, t in a greedy embedding there is always a neighbor u of s that is closer to t according to some ...
A. Rao +13 more
core +1 more source
Greedy Intersection-Mode Routing Strategy Protocol for Vehicular Networks
Complexity, 2020 The advantages of vehicular ad hoc networks (VANETs) have been acknowledged, particularly during the last decade. Furthermore, VANET-related issues have been addressed by different researchers.
Marwan Mahmoud +1 more
doaj +1 more source
CPU–GPU Utilization Aware Energy-Efficient Scheduling Algorithm on Heterogeneous Computing Systems
IEEE Access, 2020 Nowadays, heterogeneous computing systems have proven to be a good solution for processing computation intensive high-performance applications. The main challenges for such large-scale systems are energy consumption, computing node CPU-GPU utilization ...
Xiaoyong Tang, Zhuojun Fu
doaj +1 more source
Greedy MAXCUT Algorithms and their Information Content
, 2016 MAXCUT defines a classical NP-hard problem for graph partitioning and it serves as a typical case of the symmetric non-monotone Unconstrained Submodular Maximization (USM) problem.
Bian, Yatao +2 more
core +1 more source