Sciweavers

1566 search results - page 298 / 314
» Saving Space in a Time Efficient Simulation Algorithm
Sort
View
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 8 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson
ECCV
2008
Springer
14 years 6 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
SECON
2008
IEEE
14 years 2 months ago
Optimal Buffer Management Policies for Delay Tolerant Networks
—Delay Tolerant Networks are wireless networks where disconnections may occur frequently due to propagation phenomena, node mobility, and power outages. Propagation delays may al...
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulo...
CORR
2007
Springer
151views Education» more  CORR 2007»
13 years 7 months ago
Exploiting Multi-Antennas for Opportunistic Spectrum Sharing in Cognitive Radio Networks
—In cognitive radio (CR) networks, there are scenarios where the secondary (lower priority) users intend to communicate with each other by opportunistically utilizing the transmi...
Rui Zhang, Ying-Chang Liang
AICCSA
2008
IEEE
216views Hardware» more  AICCSA 2008»
13 years 7 months ago
Mining fault tolerant frequent patterns using pattern growth approach
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
Shariq Bashir, Zahid Halim, Abdul Rauf Baig