Sciweavers

1810 search results - page 333 / 362
» BASE: Using Abstraction to Improve Fault Tolerance
Sort
View
ICGA
2007
157views Optimization» more  ICGA 2007»
14 years 9 months ago
Computing "Elo Ratings" of Move Patterns in the Game of Go
Abstract. Move patterns are an essential method to incorporate domain knowledge into Go-playing programs. This paper presents a new Bayesian technique for supervised learning of su...
Rémi Coulom
TC
2008
14 years 9 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
ENTCS
2002
78views more  ENTCS 2002»
14 years 9 months ago
Separating concerns in a high-level component-based context
Building on the work of architectural description languages and aspect-oriented programming, we try to improve current visual component composition environments. In our , we intro...
Wim Vanderperren, Bart Wydaeghe
MONET
2007
132views more  MONET 2007»
14 years 9 months ago
QUORUM - Quality of Service in Wireless Mesh Networks
Abstract Wireless mesh networks (WMNs) can provide seamless broadband connectivity to network users with low setup and maintenance costs. To support nextgeneration applications wit...
Vinod Kone, Sudipto Das, Ben Y. Zhao, Haitao Zheng
CIKM
2010
Springer
14 years 8 months ago
Term necessity prediction
The probability that a term appears in relevant documents ( ) is a fundamental quantity in several probabilistic retrieval models, however it is difficult to estimate without rele...
Le Zhao, Jamie Callan