Results 41 to 50 of about 1,167,396 (296)
Online Bi-Criteria Scheduling on Batch Machines with Machine Costs
We consider online scheduling with bi-criteria on parallel batch machines, where the batch capacity is unbounded. In this paper, online means that jobs’ arrival is over time.
Wenhua Li, Weina Zhai, Xing Chai
doaj +1 more source
On the Continuous CNN Problem [PDF]
In the (discrete) CNN problem, online requests appear as points in $\mathbb{R}^2$. Each request must be served before the next one is revealed. We have a server that can serve a request simply by aligning either its $x$ or $y$ coordinate with the request.
Augustine, John, Gravin, Nick
core +1 more source
This study investigates the dynamical behavior of a ratio-dependent Lotka–Volterra competitive-competitive-cooperative system with feedback controls and delays. Compared with previous studies, both ratio-dependent functional responses and time delays are
Ahmadjan Muhammadhaji +2 more
doaj +1 more source
Exploring processed common beans market in Kenya: Implications for the business community
In Kenya, like in many developing countries, the food consumption patterns among the elites and middle classes are shifting towards the consumption of convenient processed foods.
Immaculate Babirye +5 more
doaj +1 more source
dentifying the Factors Affecting the Financial Risks of Companies Using the Structural Equations Approach [PDF]
The purpose of this study is to investigate the mediating role of the cost stickiness in the relationship between intangible assets and the purpose of this paper was to identify the factors affecting the financial risks of companies by considering the ...
saman tavakoli, Ali Ashtab
doaj +1 more source
Metrical Service Systems with Multiple Servers [PDF]
We study the problem of metrical service systems with multiple servers (MSSMS), which generalizes two well-known problems -- the $k$-server problem, and metrical service systems.
Chiplunkar, Ashish, Vishwanathan, Sundar
core +1 more source
On the Competitive Ratio of the Random Sampling Auction [PDF]
We give a simple analysis of the competitive ratio of the random sampling auction from [10]. The random sampling auction was first shown to be worst-case competitive in [9] (with a bound of 7600 on its competitive ratio); our analysis improves the bound to 15.
Uriel Feige +3 more
openaire +1 more source
Relaxing the Irrevocability Requirement for Online Graph Algorithms [PDF]
Online graph problems are considered in models where the irrevocability requirement is relaxed. Motivated by practical examples where, for example, there is a cost associated with building a facility and no extra cost associated with doing it later, we ...
A Gu +15 more
core +3 more sources
We investigated the soybean productivity of double cropping and relay intercropping in farmer’s fields for three years using two black soybean cultivars of Kurozukin and Tanbaguro, which are used for the first and second crop, respectively.
Koji Yamane +2 more
doaj +1 more source
Objectives: We evaluated the occurrence rate of competitive flow and the fate of grafts of left internal thoracic artery (LITA)-to-left anterior descending coronary artery (LAD) anastomosis after coronary artery bypass grafting with Y-composite grafts ...
Ji Seong Kim, MD, PhD +3 more
doaj +1 more source

