نتایج جستجو برای: refueling problem
تعداد نتایج: 880714 فیلتر نتایج به سال:
Although most people are thought to receive their highest acute exposures to gasoline while refueling, relatively little is actually known about personal, nonoccupational exposures to gasoline during refueling activities. This study was designed to measure exposures associated with the use of an oxygenated fuel under cold conditions in Fairbanks, Alaska. We compared concentrations of gasoline c...
v PREFACE Ever since the dawn of civilization, it has been man's dream and wish to fly. This dream became reality when the Wright brothers first took to the sky. To be able to humbly contribute to further technological advancement of the aerospace industry is a dream come true. Due to the increasingly more aggressive competition in the aviation industry, many new concepts were developed. One of...
there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...
bi = supply/demand corresponding to a node in Vn C M = cost of an egalitarian peer-to-peer solution M CLB = optimal value of objective function of the optimization problem cij = cost of an edge in Gn cij = cost of an edge in G‘ c i; j; k = cost of a triplet i; j; k representing an egalitarian peer-to-peer maneuver d = distance between two triplets tp and tq E‘ = set of edges in G‘ Ef = set of e...
This paper presents a network model with discrete requirements for a nuclear power plant. The model determines the batch size and timing for nuclear unit refueling and how much energy should be produced by nuclear and non-nuclear units for each time period to satisfy forecasted demand with minimum total operating costs over the planning horizon. Efficient modeling and solution strategies are de...
We study how a mobile robot can learn an unknown environment in a piecemeal manner The robot s goal is to learn a complete map of its environment while satisfying the constraint that it must return every so often to its starting position for refueling say The environment is modeled as an arbitrary undirected graph which is initially unknown to the robot We assume that the robot can distinguish ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید