Sciweavers

2194 search results - page 9 / 439
» Improving HLRTA*( k )
Sort
View
TPDS
2008
67views more  TPDS 2008»
13 years 9 months ago
Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links
Let k 4 be even and let n 2. Consider a faulty k-ary n-cube Qk n in which the number of node faults fv and the number of link faults fe are such that fv +fe 2n-2. We prove that ...
Iain A. Stewart, Yonghong Xiang
JCIT
2010
148views more  JCIT 2010»
13 years 4 months ago
Investigating the Performance of Naive- Bayes Classifiers and K- Nearest Neighbor Classifiers
Probability theory is the framework for making decision under uncertainty. In classification, Bayes' rule is used to calculate the probabilities of the classes and it is a bi...
Mohammed J. Islam, Q. M. Jonathan Wu, Majid Ahmadi...
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
14 years 2 months ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
IIE
2008
123views more  IIE 2008»
13 years 9 months ago
A Methodological Review of the Program Evaluations in K-12 Computer Science Education
Because of the potential for methodological reviews to improve practice, this article presents the results of a methodological review, and meta-analysis, of kindergarten through 12...
Justus J. Randolph
ICALP
2011
Springer
13 years 1 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...