1888 search results - page 252 / 378 » Proof theory and computational analysis |
104
Voted
NOSSDAV
2005
Springer
15 years 7 months ago
2005
Springer
We are concerned with the fundamental problem of event ordering in multiplayer peer-to-peer games. Event ordering, even without faults, requires all-to-all message passing with at...
122
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
We are interested in engineering smart machines that enable backtracking of emergent behaviors. Our SSNNS simulator consists of hand-picked tools to explore spiking neural network...
120
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
108
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
117
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...