Optimization and Search Problems
Optimization and Search Problems is a research topic within Computer Networks and Communications. Science Explorer counts 26k research works in it since 1956. 10.0% of them reached the world's top 10% most cited for their field and year.
This cluster of papers focuses on the development and analysis of online algorithms for distributed coordination of mobile robots, with applications in areas such as ad auctions, resource allocation, stochastic matching, and rendezvous search. The research explores techniques for competitive analysis, learning automata, and buffer management in the context of online robotics.
- Online Algorithms
- Mobile Robots
- AdWords Problem
- Resource Allocation
- Stochastic Matching
- Gathering Algorithms
- Learning Automata
- Competitive Analysis
- Rendezvous Search
- Buffer Management
- Research works
- 26k fractional, since 1956
- In the world top 10%
- 2.6k per year above
- Top-10% rate
- 10.0% share of its works in the world top 10%
- Growth, 2018-21 → 2022-25
- +11% the tick is no change
- Largest producer
China
39% of the 10 largest, 2022-now
Discussion
Ask a question or share a note about Optimization and Search Problems. Posts are plain text and can be reported.