Sciweavers

2100 search results - page 399 / 420
» Fundamentals of the problem
Sort
View
ICALP
1997
Springer
14 years 1 months ago
Recursive Computational Depth
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...
James I. Lathrop, Jack H. Lutz
FP
1989
124views Formal Methods» more  FP 1989»
14 years 1 months ago
Deriving the Fast Fourier Algorithm by Calculation
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
Geraint Jones
APCHI
2004
IEEE
14 years 22 days ago
Understanding Interaction Experience in Mobile Learning
The convergence of mobile technology and e-learning has generated considerable excitement among both practitioners and academics. Mass media continually promotes novel idea about m...
Fariza Hanis Abdul Razak
ATAL
2006
Springer
14 years 21 days ago
Efficient agent-based cluster ensembles
Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...
Adrian K. Agogino, Kagan Tumer
DSN
2006
IEEE
14 years 19 days ago
A Contribution Towards Solving the Web Workload Puzzle
World Wide Web, the biggest distributed system ever built, experiences tremendous growth and change in Web sites, users, and technology. A realistic and accurate characterization ...
Katerina Goseva-Popstojanova, Fengbin Li, Xuan Wan...