نتایج جستجو برای: semi obnoxious
تعداد نتایج: 142191 فیلتر نتایج به سال:
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at two given points. In other words, given a set S of points in the plane and a positive value l0, we want to compute an anchored 1-corner polygonal chain having length at most l0 such that the minimum distance to the point...
Taste is mainly a function of taste buds in the mouth. In the formulation for pediatric & geriatric, bed ridden & non-cooperative patients the main challenge to the compounding pharmacist is to mask the taste of obnoxious and bitter drugs, result is patient not receiving the optimal therapeutic value of their medication. Taste masking is the main factor in the development of the dosage form. It...
Moneyless strategy-proof mechanism on single-sinked policy domain: characterization and applications
We completely characterize deterministic strategy-proof and group strategy-proof mechanisms on singlesinked public policy domain. The single-sinked domain can be used to model any allocation problem where a single output must be chosen in an interval with the assumption that agents’ preferences have a single most loathful point (the sink) in the interval, and the preferences are increasing as o...
Unmanned Aerial Vehicle (UAV) have emerged as a promising technique to rapidly provide wireless services group of mobile users simultaneously. The paper aims address challenging issue that each user is selfish and may misreport his location or preference for changing the optimal UAV be close himself. Using algorithmic game theory, we study how determine final in 3D space, by ensuring all users'...
The problem considered in this paper is the weighted obnoxious facility location convex hull of demand points. objective function to maximize smallest distance between a and set Three new optimal solution approaches are proposed. Two variants Big Triangle Small global optimization method, procedure based on intersection points Apollonius circles. We also compared results with multi-start approa...
During our investigation on the metabolism of biochemical mutants of yeast (Saccharomyces cerevisiae), we found that one mutant (strain 3212) produced an abnormal, unpleasant odor during fermentation in the presence of cinnamaldehyde. The compound associated with the obnoxious odor was isolated and identified as styrene. Since this unusual formation of a hydrocarbon during yeast fermentation ha...
The cyclic antibandwidth problem is to embed an n-vertex graph into the cycle Cn, such that the minimum distance (measured in the cycle) of adjacent vertices is maximised. This is a variant of obnoxious facility location problems or a dual problem to the cyclic bandwidth problem. The problem is NP-hard. In the paper we start investigating this invariant for typical graphs. We prove basic facts ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید