Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Anytime algorithm

Known as: Anytime 
In computer science, an anytime algorithm is an algorithm that can return a valid solution to a problem even if it's interrupted at any time before… Expand
Wikipedia

Related topics

Related topics

19 relations
Action selectionAlgorithmAnalysis of algorithmsBeam search
Expand

Broader (1)

Artificial intelligence

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Edge Intelligence: Paving the Last Mile of Artificial Intelligence With Edge Computing
With the breakthroughs in deep learning, the recent years have witnessed a booming of artificial intelligence (AI) applications… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2019
Review
2019
Design Challenges of Multi-UAV Systems in Cyber-Physical Applications: A Comprehensive Survey and Future Directions
Unmanned aerial vehicles (UAVs) have recently rapidly grown to facilitate a wide range of innovative applications that can… Expand
  • table 1
  • figure 5
  • figure 6
  • figure 8
  • figure 9
Is this relevant?
Review
2019
Review
2019
Internet of Things applications: A systematic review
Abstract Internet of Things (IoT) is considered as an ecosystem that contains smart objects equipped with sensors, networking and… Expand
Is this relevant?
Review
2018
Review
2018
Integrated Data and Energy Communication Network: A Comprehensive Survey
In order to satisfy the power thirst of communication devices in the imminent fifth generation era, wireless charging techniques… Expand
  • table I
  • figure 1
  • figure 2
  • table II
  • figure 3
Is this relevant?
Review
2018
Review
2018
Initial Access, Mobility, and User-Centric Multi-Beam Operation in 5G New Radio
5G radio access networks are expected to provide very high capacity, ultra-reliability and low latency, seamless mobility, and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Anytime Motion Planning using the RRT*
The Rapidly-exploring Random Tree (RRT) algorithm, based on incremental sampling, efficiently computes motion plans. Although the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
An Anytime Algorithm for Optimal Coalition Structure Generation
Coalition formation is a fundamental type of interaction that involves the creation of coherent groupings of distinct, autonomous… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Anytime Dynamic A*: An Anytime, Replanning Algorithm
We present a graph-based planning and replanning algorithm able to produce bounded suboptimal solutions in an anytime fashion… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Point-based value iteration: An anytime algorithm for POMDPs
This paper introduces the Point-Based Value Iteration (PBVI) algorithm for POMDP planning. PBVI approximates an exact value… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE