ScholarIQanswers from OpenAlex
Optimization and Search Problems
TopicLeading institutions, researchers & key papers
Optimization and Search Problems is a topic indexed in ScholarIQ from OpenAlex.
What is known about Optimization and Search Problems?
ScholarIQrecord summary
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.
How many works does Optimization and Search Problems have?
ScholarIQindexed works
Optimization and Search Problems has 17 works in the ScholarIQ index. The count is the OpenAlex total, not the number of papers listed on this page.
What is the OpenAlex record for Optimization and Search Problems?
ScholarIQopenalex
The OpenAlex for Optimization and Search Problems is on the source record.
What are the most-cited papers on Optimization and Search Problems?
ScholarIQmost cited works
Behavioral control for multi-robot perimeter patrol: A Finite State Automata approach
Alessandro Marino, Lynne E. Parker, Gianluca Antonelli, Fabrizio Caccavale
Online Disjoint Set Cover Without Prior Knowledge
Yuval Emek, Adam Goldbraikh, Erez Kantor
Where is Optimization and Search Problems research published, and who funds it?
ScholarIQvenues & funding sources
TOP FUNDERS
National Science Foundation—
NIH—
Wellcome Trust—
European Research Council—
Funder breakdown is a member featureSign up free to unlock
How much of the research on Optimization and Search Problems is open access?
ScholarIQopen access share
50%OPEN ACCESS