Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
What we know is less important than our capacity to continue to learn more until e-learning appeared. While e-learning technology… 
Highly Cited
2009
Highly Cited
2009
With the tremendous growth of ICT (Information and Communication Technology), we are able to generate, store, share and transfer… 
Review
2008
Review
2008
Speech processing and speech transmission technology are expanding fields of active research. New challenges arise from the… 
Highly Cited
2005
Highly Cited
2005
With a rapid development of ubiquitous computing technology in the home and community, users can access information anytime and… 
Review
2005
Review
2005
Today’s tourists expect to get personalized access to tourism information at anytime, from anywhere with any media. Mobile… 
Highly Cited
2003
Highly Cited
2003
The combination of 3G and WLAN wireless technologies offers the possibility of achieving anywhere, anytime Internet access… 
Highly Cited
2002
Highly Cited
2002
The dawning of the 21st century has seen unprecedented growth in the number of wireless users, applications, and network access… 
2000
2000
Second- and third-generation (2G and 3G) wireless systems have been designed primarily for voice, a connection-oriented, delay… 
Review
2000
Review
2000
In the future, the world of telecommunications will be vastly different than it is today. The driving force will be the seamless… 
Highly Cited
1998
Highly Cited
1998
Currently worldwide activities are going on to define third-generation mobile radio systems (IMT-2000 on ITU/UMTS in Europe…