Transformational methods and their application to complexity problems
نویسندگان
چکیده
منابع مشابه
construction and validation of translation metacognitive strategy questionnaire and its application to translation quality
like any other learning activity, translation is a problem solving activity which involves executing parallel cognitive processes. the ability to think about these higher processes, plan, organize, monitor and evaluate the most influential executive cognitive processes is what flavell (1975) called “metacognition” which encompasses raising awareness of mental processes as well as using effectiv...
On Eulerian Extension Problems and their Application to Sequencing Problems
We introduce a new technique for solving several sequencing problems. We consider Gilmore and Gomory’s variant of the Traveling Salesman Problem and two variants of no-wait flowshop scheduling, the classical makespan minimization problem and a new problem arising in the multistage production process in steel manufacturing. Our technique is based on an intuitive interpretation of sequencing prob...
متن کاملspecialized methods to teach spelling: comparing three methods
چکیده: بررسی ادبیات مربوطه در کشور در زمینه یادگیری زبان انگلیسی نشان میدهد که علیرغم اهمیت املا در فرآیند یادگیری به طور عام و یادگیری زبان انگلیسی به طور خاص، این مولفه از جایگاهی متناسب با اهمیت آن برخوردار نیست و عمدتاً نادیده گرفته شده است. تحقیقات گستردهای در خارج از کشور در مورد ماهیت این مولفه صورت گرفته است، در حالی که به جرأت میتوان گفت در داخل کشور گامی در مورد درک ماهیت آن و فرآی...
15 صفحه اولMultistep methods for SDEs and their application to problems with small noise
In this article the numerical approximation of solutions of Itô stochastic differential equations is considered, in particular for equations with a small parameter 2 in the noise coefficient. We construct stochastic linear multi-step methods and develop the fundamental numerical analysis concerning their mean-square consistency, numerical stability in the mean-square sense and mean-square conve...
متن کاملEfficient Universal Pushdown Cellular Automata and Their Application to Complexity
In order to obtain universal classical cellular automata an in nite space is required. Therefore, the number of required processors depends on the length of input data and, additionally, may increase during the computation. On the other hand, Turing machines are universal devices which have one processor only and additionally an in nite storage tape. Here an in some sense intermediate model is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 1976
ISSN: 0001-5903,1432-0525
DOI: 10.1007/bf00263746