Sciweavers

1888 search results - page 342 / 378
» Proof theory and computational analysis
Sort
View
PODC
2006
ACM
14 years 2 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
PODC
2005
ACM
14 years 2 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
DIGRA
2005
Springer
14 years 2 months ago
/hide: The aesthetics of group and solo play
In this essay, I examine differences between individual and social play and, in particular, the differences between individual and social play within digital media forms designed ...
David Myers
PVG
2003
IEEE
212views Visualization» more  PVG 2003»
14 years 1 months ago
SLIC: Scheduled Linear Image Compositing for Parallel Volume Rendering
Parallel volume rendering offers a feasible solution to the large data visualization problem by distributing both the data and rendering calculations among multiple computers con...
Aleksander Stompel, Kwan-Liu Ma, Eric B. Lum, Jame...
ATAL
2008
Springer
13 years 10 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...