1497 search results - page 135 / 300 » A Computational Model for Message Passing |
JMLR
2010
13 years 3 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
AINA
2009
IEEE
14 years 3 months ago
2009
IEEE
This paper introduces a novel approach for modelling and specifying behaviors of Web services. This approach excludes Web services from any composition scenario and sheds the ligh...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
Studies of gene expression using high-density oligonucleotide microarrays have become standard in a variety of biological contexts. The data recorded using the microarray techniqu...
SC
2005
ACM
14 years 1 months ago
2005
ACM
Columbia is a 10,240-processor supercluster consisting of 20 Altix nodes with 512 processors each, and currently ranked as one of the fastest computers in the world. In this paper...
ICDM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...