We consider the fundamental task of graph exploration. An n-node graph has unlabeled nodes, and all ports at any node of degree d are arbitrarily numbered 0, . . . , d − 1. A mobile agent, initially situated at some starting node v, has to visit all nodes and stop. The time of the exploration is the number of edge traversals. We consider the problem of how much knowledge the agent has to have a...

The multi-robot exploration problem is to explore an unknown graph of size n and depth d with k robots starting from the same node. For known graphs a traversal of all nodes takes at most O(d + n/k) steps. The ratio between the time until cooperating robots explore an unknown graph and the optimal traversal of a known graph is called the competitive exploration time ratio. It is known that for ...

one of the major strengths of a geographic information system (gis) in geosciences is the ability to integrate and combine multiple layers into mineral potential maps showing areas which are favorable for mineral exploration. these capabilities make gis an extremely useful tool for mineral exploration. several spatial modeling techniques can be employed to produce potential maps. however, these...

A large quantity of data in earthquake, well-log, grilling, geology and other non-seismic geophysics, has been accumulated during long period of petroleum prospecting. These data are stored in papery document and managed in low efficient manual management. This paper proposed this petroleum exploration information management system which adopts SQL Server2000 as database server and combines B/S...

porosity is considered as an important petrophysical parameter in characterizing reservoirs, calculating in-situ oil reserves, and production evaluation. nowadays, using intelligent techniques has become a popular method for porosity estimation. support vector machine (svm) a new intelligent method with a great generalization potential of modeling non-linear relationships has been introduced fo...

An n-node tree has to be explored by k mobile agents (robots), starting in its root. Every edge of the tree must be traversed by at least one robot, and exploration must be completed as fast as possible. Even when the tree is known in advance, scheduling optimal collective exploration turns out to be NP-hard. We investigate the problem of distributed collective exploration of unknown trees. Not...

Abstract: In this paper, we suggest using a skew Gaussian-log Gaussian model for the analysis of spatial censored data from a Bayesian point of view. This approach furnishes an extension of the skew log Gaussian model to accommodate to both skewness and heavy tails and also censored data. All of the characteristics mentioned are three pervasive features of spatial data. We utilize data augme...