Cooperation Between Astronomers, Meteorologists and Geodesists for Solving Refractional Problems
نویسندگان
چکیده
منابع مشابه
Multiagent cooperation for solving global optimization problems: an extendible framework with example cooperation strategies
This paper proposes the use of multiagent cooperation for solving global optimization problems through the introduction of a new multiagent environment, MANGO. The strength of the environment lays in its flexible structure based on communicating software agents that attempt to solve a problem cooperatively. This structure allows the execution of a wide range of global optimization algorithms de...
متن کاملAn efficient approach for solving layout problems
This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...
متن کاملglobal results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
MODIFIED K-STEP METHOD FOR SOLVING FUZZY INITIAL VALUE PROBLEMS
We are concerned with the development of a K−step method for the numerical solution of fuzzy initial value problems. Convergence and stability of the method are also proved in detail. Moreover, a specific method of order 4 is found. The numerical results show that the proposed fourth order method is efficient for solving fuzzy differential equations.
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symposium - International Astronomical Union
سال: 1979
ISSN: 0074-1809
DOI: 10.1017/s0074180900066183