Add to ORKGThe searching problem for an object in a set of N locations is considered. The goal is to allocate the resources so as to maximize the probability of locating the object. By using Lagrangian operator method the problem of optimal search with the unknown target distribution is studied. Some selection criteria and error estimate results are derived
Abstract.Discrete location theory is one of the most dynamic areas of op-erations research. We prese...
In this paper, we present an efficient global-search strat-egy in an algorithm based on the theory o...
The purpose of this paper is to study the coordinated search problem in which velocity of the search...
We consider the problem of searching for an object in a set of N locations (or bins) {C1,...CN}. The...
We revisit the problem of searching for a target at an unknown location on a line when given upper a...
This paper investigates the Discrete Targets Search Problem, (DTSP), which aims to quickly search fo...
Abstract. Satisfiability is a class of NP-complete problems that model a wide range of real-world ap...
We investigate the problem in which an agent has to find an object that moves between two locations ...
Abstract This paper investigates a search problem for a moving target on a network in which any time...
We revisit the problem of searching for a target at an unknown location on a line when given upper a...
We investigate the problem in which an agent has to find an object that moves between two locations ...
We consider a search for a target moving within a known indoor environment partitioned into intercon...
A hidden target needs to be found by a searcher in many real-life situations, some of which involve ...
We consider a generalization of the linear search problem where the searcher has low sensing capabil...
summary:In this paper an introduction to the theory of search, as developed in the previous papers o...
Abstract.Discrete location theory is one of the most dynamic areas of op-erations research. We prese...
In this paper, we present an efficient global-search strat-egy in an algorithm based on the theory o...
The purpose of this paper is to study the coordinated search problem in which velocity of the search...
We consider the problem of searching for an object in a set of N locations (or bins) {C1,...CN}. The...
We revisit the problem of searching for a target at an unknown location on a line when given upper a...
This paper investigates the Discrete Targets Search Problem, (DTSP), which aims to quickly search fo...
Abstract. Satisfiability is a class of NP-complete problems that model a wide range of real-world ap...
We investigate the problem in which an agent has to find an object that moves between two locations ...
Abstract This paper investigates a search problem for a moving target on a network in which any time...
We revisit the problem of searching for a target at an unknown location on a line when given upper a...
We investigate the problem in which an agent has to find an object that moves between two locations ...
We consider a search for a target moving within a known indoor environment partitioned into intercon...
A hidden target needs to be found by a searcher in many real-life situations, some of which involve ...
We consider a generalization of the linear search problem where the searcher has low sensing capabil...
summary:In this paper an introduction to the theory of search, as developed in the previous papers o...
Abstract.Discrete location theory is one of the most dynamic areas of op-erations research. We prese...
In this paper, we present an efficient global-search strat-egy in an algorithm based on the theory o...
The purpose of this paper is to study the coordinated search problem in which velocity of the search...