Research article · 21 Jul 2015
Research articlePublished Oct 2013
Boosting As a Metaphor for Algorithm Design
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
Although some algorithms are better than others on average, there is rarely a best algorithm for a given problem. Instead, different algorithms often perform well on algorithms for solving NP-hard problems, when run times are highly variable from instance to instance. When algorithms exhibit high run time variance, one is faced with the problem of deciding which algorithm is to be used.
Ask about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Research article · Apr 2015
Survey on DSTC and PA-PSO Algorithm through Cross Layer Design in MANET
Research article · May 2014
Design and Implementation of Efficient Packet Scheduling Algorithm
Research article · Mar 2014
A N-Radon Slantlet Transforms Based OFDM System Design with PCC Algorithm to improve the Performance
Research article · May 2013
Design and Simulation of a Novel Multistage Beamforming Algorithm for Mobile Communication
More from this journal
The newest in International Journal of Innovative Research in Computer and Communication Engineering.
Commentary · 2023
Computer Vision and Pattern Recognition
Commentary · 2023
Computer Network and Network Optimization
Perspective · 2023
Cloud Computing and Big Data Analysis
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalInternational Journal of Innovative Research in Computer and Communication Engineering
- SubjectComputer Science & IT
- SubjectEngineering
- SubjectSocial Sciences & Humanities
- BylineArticles whose byline prints “Kannan Subramanian”
