4839 search results - page 658 / 968 » Providing SCORM with adaptivity |
226
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
171
click to vote
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
Finding data items is one of the most basic services of any distributed system. It is particular challenging in ad-hoc networks, due to their inherent decentralized nature and lac...
203
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
171
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
There exists a huge demand for multimedia goods and services in the Internet. Currently available bandwidth speeds can support sale of downloadable content like CDs, e-books, etc....
164
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
This paper is concerned with the construction of regression and classification trees that are more adapted to data mining applications than conventional trees. To this end, we pro...