Sciweavers

5608 search results - page 367 / 1122
» On the Theory of Matchgate Computations
Sort
View
COMPGEOM
2006
ACM
16 years 24 days ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
16 years 11 days ago
Communication complexity of common voting rules
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
Vincent Conitzer, Tuomas Sandholm
BIRTHDAY
2005
Springer
16 years 11 days ago
Graph Transformation with Variables
Abstract. Variables make rule-based systems more abstract and expressive, as witnessed by term rewriting systems and two-level grammars. In this paper we show that variables can be...
Berthold Hoffmann
CCA
2005
Springer
16 years 11 days ago
Representing Probability Measures using Probabilistic Processes
In the Type-2 Theory of Effectivity, one considers representations of topological spaces in which infinite words are used as “names” for the elements they represent. Given s...
Matthias Schröder, Alex K. Simpson
DIGRA
2005
Springer
16 years 11 days ago
Towards an Ontological Language for Game Analysis
The Game Ontology Project (GOP) is creating a framework for describing, analyzing and games, by defining a hierarchy of concepts abstracted from an analysis of many specific games...
José Pablo Zagal, Michael Mateas, Clara Fer...