Sciweavers

2200 search results - page 185 / 440
» Bloch's Constant is Computable
Sort
View
TCS
2008
15 years 6 months ago
Solving NP-complete problems in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...
Yuriy Brun
PODC
2010
ACM
15 years 10 months ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 6 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
SIGGRAPH
2010
ACM
15 years 11 months ago
Filament-based smoke with vortex shedding and variational reconnection
Simulating fluids based on vortex filaments is highly attractive for the creation of special effects because it gives artists full control over the simulation using familiar too...
Steffen Weißmann, Ulrich Pinkall
AROBOTS
2006
95views more  AROBOTS 2006»
15 years 6 months ago
Treemap: An O(log n) algorithm for indoor simultaneous localization and mapping
This article presents a very efficient SLAM algorithm that works by hierarchically dividing a map into local regions and subregions. At each level of the hierarchy each region sto...
Udo Frese