11395 search results - page 1912 / 2279 » Beyond computer science |
167
click to vote
ICALP
1992
Springer
15 years 11 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
194
click to vote
STOC
1993
ACM
15 years 11 months ago
1993
ACM
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
230
click to vote
AI50
2006
15 years 10 months ago
2006
Abstract. This paper describes a multi-disciplinary initiative to promote collaborative research in enactive artificial cognitive systems by developing the iCub : a open-systems 53...
182
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
190
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Multi-agent systems benefit greatly from an organization design that guides agents in determining when to communicate, how often, with whom, with what priority, and so on. However...