نتایج جستجو برای: operator assignment

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

2015
Daniel Tran Mark D. Johnston

NASA’s Deep Space Network (DSN) provides communication and other services for planetary exploration for both NASA and international users. The DSN operates antennas at three complexes: Goldstone, California, USA; Madrid, Spain; and Canberra, Australia, with the longitudinal distribution of the complexes enabling full sky coverage and generally providing some overlap in spacecraft visibility. Be...

2012
Fei Li Diwakar Gupta

An instance of the operational fixed job scheduling problem arises when open work caused by unplanned events such as bus breakdowns and inclement weather and driver (operator) absenteeism needs to be covered by reserve (extraboard) drivers. Each work piece, which is referred to as a job, requires one operator who must work continuously between specified start and end times to complete the job. ...

2017
David L. la Red Martínez

In distributed processing systems it is often necessary to coordinate the allocation of shared resources that should be assigned to processes in the modality of mutual exclusion; in such cases, the order in which the shared resources will be assigned to processes that require them must be decided; in this paper we propose an aggregation operator (which could be used by a shared resources manage...

2014
Z H Ahmed

Since crossover operator plays a vital role in genetic algorithms (GAs), several crossover operators have been proposed for the travelling salesman problem, which are then modified for the quadratic assignment problem (QAP). In this paper, we modify the sequential constructive crossover (SCX) operator for a simple GA to find heuristic solution to the QAP. Efficiency of the proposed GA using SCX...

2008
Zhaoqiang Ge

Abstract: Pole assignment by feedback control of the second order coupled singular distributed parameter systems is discussed via functional analysis and operator theory in Hilbert space. The solutions of the problem and the constructive expression of the solutions are given by the generalized inverse one of bounded linear operator. This research is theoretically important for studying the stab...

2007
Francisco P. M. Oliveira João Manuel R. S. Tavares

The work here described consists in searching for the optimum global matching between contours of two objects represented in images, which are sampled by equal or different number of points. Thus, to determine the optimum global matching between the points of two contours, it is used curvature information, that is totally invariant to rigid transformations. For the case of contours sampled by d...

1997
Claude Bernard Tom Blum Carleton DeTar Steven Gottlieb Urs M. Heller Jim Hetrick Craig McNeile Kari Rummukainen Bob Sugar Doug Toussaint Matthew Wingate

Light hadron spectrum—MILC results with the Kogut-Susskind and Wilson actions∗ Claude Bernard, Tom Blum, Carleton DeTar, Steven Gottlieb, Urs M. Heller, Jim Hetrick, Craig McNeile, Kari Rummukainen, Bob Sugar, Doug Toussaint, and Matthew Wingate i Department of Physics, Washington University, St. Louis, MO 63130, USA Department of Physics, Brookhaven National Lab, Upton, NY 11973, USA Physics D...

2002
Alejandro Mosquera Gómez Gürsel A. Süer

In this paper, a three-phase hierarchical methodology with two approaches is proposed to find the optimal manpower assignment and cell loads simultaneously and finally to sequence the jobs per cell such that specified performance measures are optimized. The first approach deals with the application of the linear programming optimization technique and the second one is based on the application o...

2009

One of the choices that most affect the performance of Evolutionary Algorithms is the selection of the variation operators that are efficient to solve the problem at hand. This work presents an empirical analysis of different Adaptive Operator Selection (AOS) methods, i.e. techniques that automatically select the operator to be applied between the available ones, while searching for the solutio...

2010
Burçin Sapaz Ismail Hakki Toroslu Göktürk Üçoluk

In this work a new assignment problem with the name “Artillery Target Assignment Problem (ATAP)” is defined. ATAP is about assigning artillery guns to targets at different time instances while some objective functions are to be optimized. Since an assignment made for any time instance effect the value of the shooting ATAP is harder than the classical assignment problem. As far as the objective ...

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

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