4377 search results - page 495 / 876 » Mass problems and randomness |
237
click to vote
VTC
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Opt...
184
click to vote
HIPC
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The theory of bulk-synchronous parallel computing has produced a large number of attractive algorithms, which are provably optimal in some sense, but typically require th...
179
click to vote
ACMSE
2006
ACM
16 years 25 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...
165
click to vote
VTS
2005
IEEE
16 years 13 days ago
2005
IEEE
This paper presents a pseudo-functional BIST scheme that attempts to minimize the over-testing problem of logic BIST for delay and crosstalk-induced failures. The over-testing pro...
158
Voted
SARA
2005
Springer
16 years 10 days ago
2005
Springer
Sets of features in Markov decision processes can play a critical role ximately representing value and in abstracting the state space. Selection of features is crucial to the succe...