نتایج جستجو برای: input tasks

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

Journal: :international journal of foreign language teaching and research 0
marjan zamani english department, najafabad branch, islamic azad university, najafabad, iran hossein vahid dastjerdi english department, najafabad branch, islamic azad university, najafabad, iran

the purpose of this study was to investigate the impact of weblog task assessment on iranian efl learners’ reading ability. to this purpose, a group of 30 english language students (both male and female) in rozaneh language institute in najafabad were selected based on their performance on the opt. the researchers tried to select a homogeneous sample in terms of age factor and proficiency level...

1994
W. Feng

This paper describes heuristic algorithms for scheduling preemptive, imprecise, composite tasks with input error and end-to-end timing constraints. Each composite task consists of a chain of component tasks, where each component task is made up of a mandatory part and an optional part. Whenever a component task uses imprecise input, the mandatory and optional parts of the component task may be ...

Researchers have extensively compared different L2 learning contexts, such as EFL versus study-abroad, for their impacts on oral production; however, scant attention, if any, has been paid to comparing EFL settings in terms of input factors such as textbooks, amount of contacts in L2, and teachers. Accordingly, the effects of these factors on the oral production skills were investigated in this...

2014
Dan Alistarh James Aspnes Michael A. Bender Rati Gelashvili Seth Gilbert

Task allocation is a classic distributed problem in which a set of p potentially faulty processes must cooperate to perform a set of tasks. This paper considers a new dynamic version of the problem, in which tasks are injected adversarially during an asynchronous execution. We give the first asynchronous shared-memory algorithm for dynamic task allocation, and we prove that our solution is opti...

2013
Dan Alistarh James Aspnes Michael A. Bender Rati Gelashvili Seth Gilbert

Task allocation is a classic distributed problem in which a set of p potentially faulty processes must cooperate to perform a set of m tasks. This paper considers a new dynamic version of the problem, in which tasks are injected adversarially during an asynchronous execution. We give the first asynchronous shared-memory algorithm for dynamic task allocation, and we prove that our solution is op...

1991
Randall W. Lichota Alice H. Muntz

The design specification method described in this report treats a software architecture as a set of runtime entities, including tasks and external input/output elements, which interact either via messages or shared data structures. Tasks have a single thread of execution and represent program units that may be executed concurrently. External input elements produce input requests that in turn tr...

2000
Hossam A. ElGindy Martin Middendorf Hartmut Schmeck Bernd Schmidt

Partially reconngurable FPGAs can be shared among multiple independent tasks. When partial reconnguration is possible at run-time the FPGA controller can decide on-line were to place new tasks on the FPGA. Since on{line allocation suuers from fragmentation, tasks can end up waiting despite there being suucient, albeit non{contiguous resources available to service them. Rearranging a subset of t...

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

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