نتایج جستجو برای: search problem

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

Journal: :DEStech Transactions on Engineering and Technology Research 2019

Alice Yalaoui Christian Prins Selma Khebbache

An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...

M.A Gutiérrez-Andrade P Lara-Velázquez S.G de-los-Cobos-Silva

The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...

Houssem Eddine Nouri Khaled Ghe´dira Olfa Belkahla Driss

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...

Journal: :journal of computer and robotics 0
amir h. jadidinejad faculty of computer and information technology engineering, qazvin branch, islamic azad university, qazvin, iran fariborz mahmoudi faculty of computer and information technology engineering, qazvin branch, islamic azad university, qazvin, iran

when emerging technologies such as search engine marketing (sem) face tasks that require human level intelligence, it is inevitable to use the knowledge repositories to endow the machine with the breadth of knowledge available to humans. keyword suggestion for search engine advertising is an important problem for sponsored search and sem that requires a goldmine repository of knowledge. a recen...

Journal: :journal of industrial engineering, international 2007
m.a gutiérrez-andrade p lara-velázquez s.g de-los-cobos-silva

the robust coloring problem (rcp) is a generalization of the well-known graph coloring problem where we seek for a solution that remains valid when extra edges are added. the rcp is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. this problem has been proved as np-hard and in instances larger than 30 vertices, meta-...

The optimal reactive power dispatch (ORPD) is a very important problem aspect of power system planning and is a highly nonlinear, non-convex optimization problem because consist of both continuous and discrete control variables. Since the power system has inherent uncertainty, hereby, this paper presents both of the deterministic and stochastic models for ORPD problem in multi objective and sin...

ژورنال: اندیشه آماری 2013

The search designs first introduced in Srivastava (1975) is reviewed. In a ceritan problem, there may be some search designs with same runs. Some criteria for evaluation of search designs are the other topic in the paper. Criteria based on searching probability and expected Kullback- Leibler are reviewd. Some examples are given in each case.

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

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