5115 search results - page 330 / 1023 » On Randomized Lanczos Algorithms |
208
click to vote
WABI
2005
Springer
16 years 23 days ago
2005
Springer
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
177
click to vote
ICNP
2003
IEEE
16 years 17 days ago
2003
IEEE
Practical crossbar scheduling algorithms for CIOQ switches such as PIM and ¢ -SLIP, can perform poorly under extreme traffic conditions, frequently failing to be workconserving....
201
click to vote
CP
2003
Springer
16 years 15 days ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
212
click to vote
SARA
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
197
click to vote
FLAIRS
2004
15 years 8 months ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...