Sciweavers

1402 search results - page 125 / 281
» Sparse-Memory Graph Search
Sort
View
102
Voted
FMCO
2005
Springer
173views Formal Methods» more  FMCO 2005»
15 years 3 months ago
Cluster-Based LTL Model Checking of Large Systems
Abstract. In recent years a bundle of parallel and distributed algorithms for verification of finite state systems has appeared. We survey distributed-memory enumerative LTL mode...
Jiri Barnat, Lubos Brim, Ivana Cerná
IPPS
1999
IEEE
15 years 2 months ago
Average-Case Analysis of Isospeed Scalability of Parallel Computations on Multiprocessors
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
Keqin Li, Xian-He Sun
SIGIR
2008
ACM
14 years 9 months ago
Pagerank based clustering of hypertext document collections
Clustering hypertext document collection is an important task in Information Retrieval. Most clustering methods are based on document content and do not take into account the hype...
Konstantin Avrachenkov, Vladimir Dobrynin, Danil N...
TWC
2008
145views more  TWC 2008»
14 years 8 months ago
Generalized Window-Based PN Acquisition Scheme in CDMA Spread Spectrum Systems
In this letter, we propose a generalized version of the window-based pseudonoise (PN) acquisition scheme verifying one or more best hypotheses rather than the best one per search w...
Kwang Man Ok, Chung Gu Kang
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
14 years 8 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani