نتایج جستجو برای: all exploration data including log
تعداد نتایج: 4396628 فیلتر نتایج به سال:
abstract the aim of this study was threefold: (1) to investigate the relationship between knowledge of semantic prosody and efl learners general language proficiency; (2) to examine the relationship between qualitative as well as quantitative knowledge of words, and (3) to compare the performance of efl learner on receptive and productive measures of semantic prosody. the study is based on a...
the present study is paid to the evaluation of the welfare program of the unemployment insurance in iran. the main purpose which was the main reason for performing this thesis, was the unemployment insurance plan’s challenges in iran such as financial problems of this plan, prolongation of the credit receipt for some insured people, unemployment slow exiting from the unemployment insurance fund...
The development of cloud computing and distributed technologies has shifted log management operations to an aggregated form. Diverse information devices as well systems perform data collection status analysis through a unified aggregation system. However, with the increasingly diverse business forms, threats confronted by are also mounting, among which leakage, tampering, loss, security vulnera...
reservoir permeability is a critical parameter for characterization of the hydrocarbon reservoirs. in fact, determination of permeability is a crucial task in reserve estimation, production and development. traditional methods for permeability prediction are well log and core data analysis which are very expensive and time-consuming. well log data is an alternative approach for prediction of pe...
Abstract We review the space complexity of deterministically exploring undirected graphs. assume that vertices are indistinguishable and edges have a locally unique color guides traversal space-constrained agent. The graph is considered to be explored once agent has visited all vertices. visit results for this setting showing $$\varTheta \,(\log n)$$ <mml:math xmlns:mml="http://www.w3.org/1998/...
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connected graph. The robot’s task is to visit all nodes and edges of the graph using the minimum number R of edge traversals. Deng and Papadimitriou [Proceedings of the 31st Symposium on the Foundations of Computer Science, 1...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید