نتایج جستجو برای: talk andwithout selftalk p0121 in conclusion

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

2007
Jean-Marc Andreoli Laurent Julliard Remo Pareschi

ion-based software development, Commun. ACM 29, 5 (May 1986), 402-415. [Index Terms and Review]

1995
Barbara Hayes-Roth Karl Pfleger Philippe Lalanda

16 disjoint. It overcomes the hypothesis of existence of a precise final goal in goal-regression systems. Motivations have been shown to be useful in guiding the behavior of a mobile robot in variously configured indoor environments. Experimental results provide evidence that correlation does exist between motivational profile and environment, in order to get optimal performances of the agent. ...

1995
Sudhir Srinivasan Bronis de Supinski

UNIFY is a new scheme for maintaining consistency between aggregated and disaggregated levels. It does away with explicit switching between aggregated and disaggregated states, and instead, maintains all state information for all levels. Units can comply with interactions at different levels. Perceivers are responsible for demanding information they need. We solve the temporal consistency probl...

1996

As already mentioned, the key distribution can be made simple and effective with smart cards which also contain the DES algorithm. The cards are customised by the operator and sent to each individual subscriber. The key stored in the card is uniquely related to the subscribers logical directory number, which again is uniquely related to the physical line. A smart card can thus only be used by t...

2008
C. W. Yeh C. K. Cheng

New spectral methods for ratio cut partitioning and clustering. A general purpose multi-way partitioning, Proc. We introduced a new natural metric, Via-Count, to better estimate inter-partition delays for evaluating partitioning solutions. We presented K-VIA-FM, an algorithm that iteratively improve solutions for the new metric. We compared the performance of K-VIA-FM with other algorithms, bot...

2000
X Zhang Y Qu L Xiao S Zhou J Wang X Zheng P Delisle

A high-throughput computing policy attempts to efficiently utilize all of the resources in a cluster to generate faster overall execution. It is acceptable for jobs running on a workstation serving remote pages to execute more slowly, if other jobs benefit by achieving faster execution times through the use of network RAM, as long as throughput is maximized. Further work must be done to fully u...

2010
J. K. Aggarwal

The concurrency is classified into two types: structured concurrency and nonstructured concurrency. After showing that the nonstructured concurrency cannot be represented by the conventional notations in the Petri net language, a method to represent such concurrency by the language is proposed. The proposed method allows us to utilize the existing approaches for analyzing properties of a nonstr...

Journal: :Mathematical and Computer Modelling 2011
Gede Agus Widyadana Leopoldo Eduardo Cárdenas-Barrón Hui-Ming Wee

In this study, a deteriorating inventory problemwith andwithout backorders is developed. From the literature search, this study is one of the first attempts by researchers to solve a deteriorating inventory problem with a simplified approach. The optimal solutions are compared with the classical methods for solving deteriorating inventory model. The total cost of the simplified model is almost ...

Journal: :Australian Journal of Experimental Agriculture 2003

Journal: :Les actes de colloques du musée du quai Branly 2016

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

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