Sciweavers

8196 search results - page 139 / 1640
» Computational Modeling and Complexity Science
Sort
View
WG
2005
Springer
15 years 3 months ago
Computation of Chromatic Polynomials Using Triangulations and Clique Trees
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
Pascal Berthomé, Sylvain Lebresne, Kim Nguy...
MFCS
2010
Springer
14 years 8 months ago
Proof Systems and Transformation Games
We introduce Transformation Games (TGs), a form of coalitional game in which players are endowed with sets of initial resources, and have capabilities allowing them to derive certa...
Yoram Bachrach, Michael Zuckerman, Michael Wooldri...
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
15 years 3 months 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
HICSS
2007
IEEE
108views Biometrics» more  HICSS 2007»
15 years 4 months ago
Human Computer Interaction in the Pre-Hospital Setting
This paper describes the human computer interface of a new emergency medical services application, which uses several emerging technologies to clarify the inherent complexity and ...
Mark Gaynor, Dan Myung, Raj Patel, Steve Moulton
LICS
2009
IEEE
15 years 4 months ago
Trichotomy in the Complexity of Minimal Inference
We study the complexity of the propositional minimal inference problem. Its complexity has been extensively studied before because of its fundamental importance in artificial int...
Arnaud Durand, Miki Hermann, Gustav Nordh