نتایج جستجو برای: co farthest map

تعداد نتایج: 522648  

Journal: :IEEE Access 2022

Graph burning is a process to determine the spreading of information in graph. If sequence vertices burns all graph by following process, then such known as sequence. The problem consists finding minimum length for given solution this NP-hard combinatorial optimization helps quantify graph’s vulnerability contagion. This paper introduces simple farthest-first traversal-based approximatio...

Journal: :Int. J. Math. Mathematical Sciences 2008
Shirin Hejazian Asadollah Niknam Sedigheh Shadkam Torbati

We study the farthest point mapping in a p-normed space X in virtue of subdifferential of rx sup{{x − z p : z ∈ M}, where M is a weakly sequentially compact subset of X. We show that the set of all points in X which have farthest point in M contains a dense G δ subset of X.

Journal: :journal of paramedical sciences 0
amir kavousi department of basic sciences,faculty of health,safety and environment,shahid beheshti university of medical sciences, tehran reyhaneh sefidkar paramedical faculty, shahid beheshti university of medical sceinces, tehran hamid alavimajd department of biostatistics, para-medical faculty, shahid beheshti university of medical sceinces,tehran yousef rashidi tehran air quality control agency, tehran zeinab abolfazli khonbi english language department, faculty of medicine,kashan university of medical sciences, kashan,isfahan

nowadays, air pollution in cities with regard to its harmful outcomes has been turned into one of the serious challenges in urban management. pollutants as carbon monoxide, sulfur dioxide, and the aerosols that are known to be among the most important factors related to heart, vascular, and lung disease, have underlined public welfare and health, and the organizations concerned with community h...

Journal: :Theoretical Computer Science 2003

Journal: :Journal of Approximation Theory 1979

Journal: :Information Visualization 2010
Benjamín Vargas-Quesada Félix de Moya Anegón Zaida Chinchilla-Rodríguez Antonio González-Molina

Category co-citation and its representation through social networks is proving to be a very adequate technique for the visualization and analysis of great scientific domains. Its combination with pathfinder networks using pruning values r=∞and q=n−1 makes manifest the essence of research in the domain represented, or what we might call the `most salient structure'. The possible loss of structur...

Journal: :نظریه تقریب و کاربرد های آن 0
حمید مظاهری تهرانی دانشگاه یزد

in this paper we obtain a necessary and a sufficient condition for the set of ω_0-nearest points ( ω_0-farthest points) to be non-empty or a singleton set in normed linear spaces. we shall find a necessary and a sufficient condition for an uniquely remotal set to be a singleton set.

Journal: :International Journal of Mathematics and Mathematical Sciences 2008

Journal: :Inf. Syst. 2013
Gae-won You Mu-Woong Lee Hyeonseung Im Seung-won Hwang

Pareto-optimal objects are favored as each of such objects has at least one competitive edge against all other objects, or “not dominated.” Recently, in the database literature, skyline queries have gained attention as an effective way to identify such pareto-optimal objects. In particular, this paper studies the pareto-optimal objects in perspective of facility or business locations. More spec...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید