Results 251 to 260 of about 4,101,702 (289)
Some of the next articles are maybe not open access.
On-line search for mobile users
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., 2005The 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, 1988zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
An improvement of the Goldstein line search
Optimization LetterszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arnold Neumaier, Morteza Kimiaei
openaire +2 more sources
A search for the prewetting line
The Journal of Chemical Physics, 1986This 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
On-Line Searching in Simple Polygons
1999In 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
2003
There is no guarantee that the local algorithms in chapters 12 and 13 will converge when they are started at a point x 1 far from a solution x * to problem (P E ) or (P EI ). They can generate erratic sequences, which may by chance enter the neighborhood of a solution and then converge to it; but most often, the sequences will not converge. There exist
J. Frédéric Bonnans +3 more
openaire +1 more source
There is no guarantee that the local algorithms in chapters 12 and 13 will converge when they are started at a point x 1 far from a solution x * to problem (P E ) or (P EI ). They can generate erratic sequences, which may by chance enter the neighborhood of a solution and then converge to it; but most often, the sequences will not converge. There exist
J. Frédéric Bonnans +3 more
openaire +1 more source
2009
We consider the well-known line search algorithm that iteratively refines the search interval by subdivision and bracketing the optimum. In our applications, evaluations of the objective function typically require minutes or hours, so it becomes attractive to use more than the standard three steps in the subdivision, performing the evaluations in ...
Peachey, T. C., Abramson, D., Lewis, A.
openaire +3 more sources
We consider the well-known line search algorithm that iteratively refines the search interval by subdivision and bracketing the optimum. In our applications, evaluations of the objective function typically require minutes or hours, so it becomes attractive to use more than the standard three steps in the subdivision, performing the evaluations in ...
Peachey, T. C., Abramson, D., Lewis, A.
openaire +3 more sources
A Stochastic Line Search Method with Expected Complexity Analysis
SIAM Journal on Optimization, 2020Katya Scheinberg
exaly