1884 search results - page 16 / 377 » Simple Algorithm for Simple Timed Games |
COLOGNETWENTE
2008
14 years 11 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
JMLR
2011
14 years 4 months ago
2011
This paper describes a Bayesian approximation method to obtain online ranking algorithms for games with multiple teams and multiple players. Recently for Internet games large onli...
FOCS
2006
IEEE
15 years 4 months ago
2006
IEEE
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
PODS
2004
ACM
15 years 10 months ago
2004
ACM
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...