Results 221 to 230 of about 859,071 (262)

Rendezvous Search on the Line

Operations Research, 1999
We present two new results for the asymmetric rendezvous problem on the line. We first show that it is never optimal for one player to be stationary during the entire search period in the two-player rendezvous. Then we consider the meeting time ofn-players in the worst case and show that it has an asymptotic behavior ofn/2 +O(logn).
openaire   +1 more source

Distributed On-line Bayesian Search

2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing, 2006
In this paper, we outline the basis for a new distributed Bayesian search scheme in which all Bayesian decision makers recognize the same performance objective but do not possess the ability to communicate with each other. Coordination among the players is achieved indirectly by tracking search performance.
Alfredo García 0001, Enrique Campos, Chenyang Li   +2 more
openaire   +1 more source

Medline: An introduction to on‐line searching

Journal of the American Society for Information Science, 1980
AbstractMEDLINE is presented as a prototype for on‐line bibliographic search systems. Creation of the data base, indexing language, and file organization are reviewed. On accessing the files, search logic is illustrated with a sample MEDLINE search.
openaire   +2 more sources

Rendezvous Search on the Labeled Line

Operations Research, 2004
The rendezvous search problem is the problem of finding optimal search strategies for two people who are placed randomly on a known search region and want to meet each other in minimal expected time. We focus on initial location distributions that are centrally symmetric and nonincreasing as one moves away from the center, including the discretized ...
Elizabeth J. Chester, Reha H. Tütüncü
openaire   +1 more source

Balancing assembly lines with tabu search

European Journal of Operational Research, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sophie D. Lapierre, Angel B. Ruiz, Patrick Soriano   +2 more
openaire   +3 more sources

On-line search for mobile users

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., 2005
The problem of searching for mobile users in cellular networks is addressed in this study. Previous studies addressing this issue have focused on the problem of searching for a single user. The underlying assumption for this approach is that some straightforward strategy of searching for multiple users can be easily derived from a single user search ...
openaire   +1 more source

Line arrangements and range search

Information Processing Letters, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

An improvement of the Goldstein line search

Optimization Letters
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arnold Neumaier, Morteza Kimiaei
openaire   +2 more sources

On-Line Searching in Simple Polygons

1999
In this paper we study the problem of a robot searching for a visually recognizable target in an unknown simple polygon. We present two algorithms. Both work for arbitrarily oriented polygons. The search cost is proportional to the distance traveled by the robot. We use competitive analysis to judge the performance of our strategies. The first one is a
openaire   +1 more source

A search for the prewetting line

The Journal of Chemical Physics, 1986
This paper describes efforts to locate the prewetting line in a binary liquid system (isopropanol–perfluoromethylcyclohexane) at the vapor–liquid interface. We placed tight upper bounds on the temperature separation (0.2 K) between the prewetting line and the line of bulk liquid phase separation.
James W. Schmidt, Michael R. Moldover
openaire   +1 more source