Sciweavers

7200 search results - page 194 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
ZUM
2000
Springer
15 years 10 months ago
A Computation Model for Z Based on Concurrent Constraint Resolution
We present a computation model for Z, which is based on a reduction to a small calculus, called Z, and on concurrent constraint resolution techniques applied for computing in thi...
Wolfgang Grieskamp
AAAI
2004
15 years 8 months ago
SEM-Ether: Semantic Web Based Pervasive Computing Framework - Integrating Web, Devices and People
Pervasive computing aims to build an aggregated environment around a user by knitting diverse computing and communicating devices and software services into a single homogeneous u...
Sushil Puradkar, Sachin Singh, Chintan Patel, Kart...
CG
2010
Springer
15 years 4 months ago
A Human-Computer Team Experiment for 9x9 Go
Monte Carlo Tree Search has given computer go a significant boost in strength the past few years, but progress seems to have slowed, and once again we have to ask ourselves how can...
Darren Cook
PODS
2002
ACM
132views Database» more  PODS 2002»
16 years 6 months ago
Distributed Computation of Web Queries Using Automata
We introduce and investigate a distributed computation model for querying the Web. Web queries are computed by interacting automata running at different nodes in the Web. The auto...
Marc Spielmann, Jerzy Tyszkiewicz, Jan Van den Bus...
PODC
2006
ACM
16 years 13 days ago
Stably computable predicates are semilinear
We consider the model of population protocols introduced by Angluin et al. [2], in which anonymous finite-state agents stably compute a predicate of their inputs via twoway inter...
Dana Angluin, James Aspnes, David Eisenstat