Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,088,289 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Action selection
Algorithm
Analysis of algorithms
Beam search
Expand
Broader (1)
Artificial intelligence
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
An enhanced e-learning ecosystem based on an integration between cloud computing and Web2.0
Shimaa Ouf
,
Mona M. Nasr
,
Y. Helmy
IEEE International Symposium on Signal Processing…
2010
Corpus ID: 10820016
What we know is less important than our capacity to continue to learn more until e-learning appeared. While e-learning technology…
Expand
Highly Cited
2009
Highly Cited
2009
Image retrieval using augmented block truncation coding techniques
H. B. Kekre
,
Sudeep D. Thepade
ICAC3 '09
2009
Corpus ID: 18475614
With the tremendous growth of ICT (Information and Communication Technology), we are able to generate, store, share and transfer…
Expand
Review
2008
Review
2008
Advances in Digital Speech Transmission
Rainer Martin
,
U. Heute
,
C. Antweiler
2008
Corpus ID: 60989510
Speech processing and speech transmission technology are expanding fields of active research. New challenges arise from the…
Expand
Highly Cited
2005
Highly Cited
2005
Context-Aware Access Control Mechanism for Ubiquitous Applications
Young-Gab Kim
,
Chang-Joo Moon
,
Dongwon Jeong
,
Jeong-Oog Lee
,
Chee-Yang Song
,
D. Baik
Atlantic Web Intelligence Conference
2005
Corpus ID: 2556197
With a rapid development of ubiquitous computing technology in the home and community, users can access information anytime and…
Expand
Review
2005
Review
2005
Context-awareness in Mobile Tourism Guides – A Comprehensive Survey
W. Schwinger
,
Christoph Grün
,
B. Pröll
,
W. Retschitzegger
,
A. Schauerhuber
2005
Corpus ID: 16450655
Today’s tourists expect to get personalized access to tourism information at anytime, from anywhere with any media. Mobile…
Expand
Highly Cited
2003
Highly Cited
2003
Design and implementation of a WLAN/cdma2000 interworking architecture
M. Buddhikot
,
Girish P. Chandranmenon
,
Seung-Jae Han
,
Yui-Wah Lee
,
Scott C. Miller
,
L. Salgarelli
IEEE Communications Magazine
2003
Corpus ID: 46946551
The combination of 3G and WLAN wireless technologies offers the possibility of achieving anywhere, anytime Internet access…
Expand
Highly Cited
2002
Highly Cited
2002
PAWNs: Satisfying the need for ubiquitos secure connectivity and location services
P. Bahl
,
W. Russell
,
Yi-Min Wang
,
Anand Balachandran
,
G. Voelker
,
Allen K. L. Miu
IEEE wireless communications
2002
Corpus ID: 17523776
The dawning of the 21st century has seen unprecedented growth in the number of wireless users, applications, and network access…
Expand
2000
2000
Challenges in low-cost wireless data transmission
R. Yates
,
N. Mandayam
IEEE Signal Processing Magazine
2000
Corpus ID: 62221476
Second- and third-generation (2G and 3G) wireless systems have been designed primarily for voice, a connection-oriented, delay…
Expand
Review
2000
Review
2000
Speech and language processing for next-millennium communications services
R. Cox
,
C. Kamm
,
L. Rabiner
,
J. Schroeter
,
J. Wilpon
Proceedings of the IEEE
2000
Corpus ID: 1987789
In the future, the world of telecommunications will be vastly different than it is today. The driving force will be the seamless…
Expand
Highly Cited
1998
Highly Cited
1998
Research activities on UMTS radio interface, network architectures, and planning
E. Berruto
,
M. Gudmundson
,
R. Menolascino
,
W. Mohr
,
M. Pizarroso
IEEE Communications Magazine
1998
Corpus ID: 60792569
Currently worldwide activities are going on to define third-generation mobile radio systems (IMT-2000 on ITU/UMTS in Europe…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE