Results 241 to 250 of about 4,101,702 (289)
Some of the next articles are maybe not open access.
On the Nonmonotone Line Search
Journal of Optimization Theory and Applications, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu-Hong Dai
exaly +2 more sources
Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference, 2009
In this paper we investigate discrete linear search and graph search problems. It is well-known that the Bounded Discrete Linear Search Problem (BDLSP) can be solved efficiently using a dynamic programming approach. However, we show that its generalization to the graph case—the Graph Search Problem (GSP)—is NP-complete. We further consider the Discrete
Hua Li, Edwin K. P. Chong
openaire +1 more source
In this paper we investigate discrete linear search and graph search problems. It is well-known that the Bounded Discrete Linear Search Problem (BDLSP) can be solved efficiently using a dynamic programming approach. However, we show that its generalization to the graph case—the Graph Search Problem (GSP)—is NP-complete. We further consider the Discrete
Hua Li, Edwin K. P. Chong
openaire +1 more source
Search on a Line with Faulty Robots
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jurek Czyzowicz +4 more
openaire +2 more sources
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
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, 2006In 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 +2 more
openaire +1 more source
Medline: An introduction to on‐line searching
Journal of the American Society for Information Science, 1980AbstractMEDLINE 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, 2004The 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, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sophie D. Lapierre +2 more
openaire +3 more sources