5115 search results - page 644 / 1023 » On Randomized Lanczos Algorithms |
165
Voted
ICSM
2006
IEEE
16 years 20 days ago
2006
IEEE
One approach to supporting program comprehension involves binding concepts to source code. Previously proposed approaches to concept binding have enforced nonoverlapping boundarie...
172
click to vote
ACMSE
2006
ACM
16 years 19 days ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
180
click to vote
ICCBR
2005
Springer
16 years 5 days ago
2005
Springer
While several researchers have applied case-based reasoning techniques to games, only Ponsen and Spronck (2004) have addressed the challenging problem of learning to win real-time ...
198
click to vote
SPAA
2004
ACM
16 years 2 days ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
170
click to vote
ESA
2004
Springer
16 years 1 days ago
2004
Springer
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of nearest...