ordering continuing functions set in backtracking algorithms
Clicks: 79
ID: 208285
2008
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Popular Article
23.4
/100
79 views
9 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #18 of 22 articles by views in current eye research
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
The paper shows how continuing functions inBacktracking algorithm can order, prove existence of bestcontinuing function and evaluate complexity of Backtrackingalgorithm for best continuing function usage.
| Reference Key |
socaciu2008journalordering
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Tiberiu Socaciu |
| Journal | current eye research |
| Year | 2008 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.