Reinventing the wheel

Known as: Reinventing the square wheel, Reinvent the wheel, Reinvention of the wheel 
To reinvent the wheel (reinvent the wheel) is to duplicate a basic method that has already previously been created or optimized by others. The… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Welcome to the 15th article in this column series. As the title suggests, each article provides insights and intuitions into… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2017
2017
The engineering of stability into a wide variety of commonly- used devices and systems is a well-known necessity. Inherently… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2012
2012
Genetic Algorithms is based on the assumption that nature can teach us how to develop artifacts able to comply with restrictions… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2008
2008
Tagline: Reusing the lessons learnt in achieving Web accessibility can speed the Mobile Web to fruition. 
Is this relevant?
Review
2007
Review
2007
A review of Timothy M. O'Brien's "Jakarta Commons Cookbook" 
Is this relevant?
2007
2007
We present a novel interface to (portable) music players that benefit from intelligently structured collections of audio files… (More)
Is this relevant?
2006
2006
Abstract: Technological advances in and convergence of the World Wide Web with Electronic Data Interchange and standard… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
2005
2005
In the domain of design, there are two ways of viewing the competitiveness of evolved structures: they either improve in some… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1996
1996
I am a cyclist. I've ridden since before my paper route at age twelve; I rode to high school; and for 12 years I rode to work. I… (More)
Is this relevant?
1993
1993
We show that, for any fixed k, there exists an optimal O(n)-space compact representation of a k-connected graph G with n vertices… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?