544 search results - page 76 / 109 » Can Realistic BitTorrent Experiments Be Performed on Cluster... |
ICS
2005
Tsinghua U.
14 years 1 months ago
2005
Tsinghua U.
Several message passing-based parallel solvers have been developed for general (non-symmetric) sparse LU factorization with partial pivoting. Due to the fine-grain synchronizatio...
CIKM
2009
Springer
14 years 20 days ago
2009
Springer
Solid State Drive (SSD), emerging as new data storage media with high random read speed, has been widely used in laptops, desktops, and data servers to replace hard disk during th...
AIIA
2003
Springer
13 years 11 months ago
2003
Springer
A novel, two stage, neural architecture for the segmentation of range data and their modeling with undeformed superquadrics is presented. The system is composed by two distinct neu...
DIS
2009
Springer
13 years 5 months ago
2009
Springer
In this paper we aim at automatically adjusting the difficulty of computer games by clustering players into different types and supervised prediction of the type from short traces ...
ICSE
2004
IEEE-ACM
14 years 8 months ago
2004
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...