نتایج جستجو برای: obnoxious

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

Journal: :J. Global Optimization 2013
Daniel Scholz

Geometric branch-and-bound methods are popular solution algorithms in deterministic global optimization to solve problems in small dimensions. The aim of this paper is to formulate a geometric branch-and-bound method for constrained global optimization problems which allows the use of arbitrary bounding operations. In particular, our main goal is to prove the convergence of the suggested method...

2012
Rajesh Kumar I. M. Talwar Eugene Y. Vasserman Nicholas James Tyra

The network Security is the hottest topic in the current research scenario. The information security is really threatened by obnoxious users. With increasing vulnerabilities, caused by port scan attacks, replay attacks and predominantly IP Spoofing, targeting services, the network behavior is getting malevolent. But there is a lack of any clear threat model. The authors have endeavored to consi...

Journal: :Annals OR 2002
Horst W. Hamacher Martine Labbé Stefan Nickel Anders J. V. Skriver

Locating a facility is often modeled as either the maxisum or the minisum problem, re ecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are both desirable and undesirable at the same time, e.g. an airport. This can be modeled as a multicriteria network location problem, where some of the sumobjectives are maximized (push e ect) and some of the sum-objectiv...

2009
Mawuli Adjei Amma Darko

Amma Darko follows in the tracks of the two leading Ghanaian women writers, Efua Sutherland and Ama Ata Aidoo. However, as a writer, Darko differs in her approach to social, political and cultural issues. Her first three novels, Beyond the Horizon (1995), The Housemaid (1998) and Faceless (2003), all present and contest the culture of patriarchy. In her works, women are victims of rape, battery...

Journal: :Theor. Comput. Sci. 2007
Boaz Ben-Moshe Binay K. Bhattacharya Qiaosheng Shi Arie Tamir

Efficient algorithms for solving the center problems in weighted cactus networks are presented. In particular, we have proposed the following algorithms for the weighted cactus networks of size n: an O(n log n) time algorithm to solve the 1center problem, an O(n log 3n) time algorithm to solve the weighted continuous 2-center problem. We have also provided improved solutions to the general p-ce...

1947
G. E. F. Sutton

" Congenital internal bending back of the sternum and ribs as the cause of difficulty in breathing. " My father showed me a boy seven years old at the house of a nobleQaan of Andlau, whose ensiform cartilage and other parts of the chest bone, together with the ribs, was bent back towards the internal parts, 8o that a great hollow appeared there. The diaphragm, he pointed out, deemed to contract...

Journal: :Annals OR 2017
Nasrin Asgari Mohsen Rajabi Masoumeh Jamshidi Maryam Khatami Reza Zanjirani Farahani

This paper proposes a model for obnoxious waste location-routing problem (LRP) considering various types of wastes and several treatment technologies. The investigated distribution network includes three echelons of generation nodes, treatment and disposal facilities. A multi-objective LRP model is developed with three objective functions minimizing the treatment and disposal facility undesirab...

Journal: :Electronic Notes in Discrete Mathematics 2001
Blaz Zmazek Janez Zerovnik

2008
Kannan Balakrishnan Boštjan Brešar Manoj Changat Sandi Klavžar Matjaž Kovše Ajitha R. Subhamathi

The set of vertices that maximize (minimize) the remoteness is the antimedian (median) set of the profile. It is proved that for an arbitrary graph G and S ⊆ V (G) it can be decided in polynomial time whether S is the antimedian set of some profile. Graphs in which every antimedian set is connected are also considered.

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

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