Results 61 to 70 of about 179,741 (181)
Special cases of online parallel job scheduling [PDF]
, 2007 In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, where the next job becomes known as soon as the current job is scheduled ...
Hurink, Johann L., Paulus, Jacob Jan
core +3 more sources
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs [PDF]
, 2012 We propose a new greedy algorithm for the maximum cardinality matching problem. We give experimental evidence that this algorithm is likely to find a maximum matching in random graphs with constant expected degree c>0, independent of the value of c. This
Dietzfelbinger, Martin +2 more
core
Scientific Journal of Informatics, 2018 At this time the delivery of goods to be familiar because the use of delivery of goods services greatly facilitate customers. PT Post Indonesia is one of the delivery of goods.
Global Ilham Sampurno +2 more
doaj +1 more source
Journal of Complexity, 2003 A dictionary is a subset \(\mathcal D\) of a Hilbert space \((H,\langle\cdot,\cdot\rangle)\) such that \(\|g\|=1\) for all \(g\in \mathcal D\) and cl-span\((\mathcal D)=H.\) The objective of greedy algorithms is to construct a sequence \(\{g_k\}\) in \(\mathcal D\) and a sequence of approximants \(G_k\in\mathcal D_k=\) span\(\{g_1,\dots,g_k\}\) such ...
Lutoborski, Adam, Temlyakov, Vladimir N.
openaire +2 more sources
Fast and flexible spatial sampling methods based on the Quadtree algorithm for ocean monitoring
Frontiers in Marine ScienceAlthough existing in situ oceanographic data are sparse, such data still play an important role in submarine monitoring and forecasting. Considering budget limitations, an efficient spatial sampling scheme is critical to obtain data with much information
Yanzhi Zhou +9 more
doaj +1 more source
Chebushev Greedy Algorithm in convex optimization [PDF]
, 2013 Chebyshev Greedy Algorithm is a generalization of the well known Orthogonal Matching Pursuit defined in a Hilbert space to the case of Banach spaces.
Temlyakov, Vladimir
core
Efficient Hardware/Software Partitioning Based on a Hybrid Algorithm
IEEE Access, 2018 Complex embedded systems with multi-processing units are important platforms for running complex tasks. In the development of complex embedded systems, hardware/software partitioning plays an important role.
Tao Zhang, Xin Zhao, Xuan Li
doaj +1 more source
Room usage optimization in timetabling: A case study at Universidade de Lisboa
Operations Research Perspectives, 2019 This paper discusses the problem of room usage optimization for university timetables: given a timetable, we want to optimize the room occupation by determining the events allocated to each room, while ensuring that the rooms have enough capacity to ...
Alexandre Lemos +3 more
doaj +1 more source
Optimization of Orthogonal Waveform Using Memetic Algorithm with Iterative Greedy Code Search
Remote SensingThe orthogonality of transmitted waveforms is an important factor affecting the performance of MIMO radar systems. The orthogonal coded signal is a commonly adopted waveform in MIMO radar, and its orthogonality depends on the used orthogonal discrete ...
Wanbin Wang, Lu Qian, Yun Zhou
doaj +1 more source
AlgorithmsThe paper discusses a greedy algorithm that can be used to solve non-smooth optimization problems in which its objective function can be represented as a minimum of a compactly parameterized family of uniformly smooth functions.
Sergei Sidorov
doaj +1 more source