Sciweavers

26354 search results - page 56 / 5271
» How we refactor, and how we know it
Sort
View
ICWL
2007
Springer
14 years 3 months ago
Learning How to Dance Using a Web 3D Platform
In this paper we present the European project Open Dance and in particular our contribution to the 3D simulation of folk dances and their presentation on the web. Our aim is to pro...
Nadia Magnenat-Thalmann, Dimitrios Protopsaltou, E...
ICRA
2008
IEEE
143views Robotics» more  ICRA 2008»
14 years 3 months ago
How morphology affects self-assembly in a stochastic modular robot
Abstract— Self-assembly is a process through which an organized structure can spontaneously form from simple parts. Taking inspiration from biological examples of self-assembly, ...
Shuhei Miyashita, Max Kessler, Marco Lungarella
ICALP
2010
Springer
13 years 11 months ago
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Mort...
ENTCS
2011
131views more  ENTCS 2011»
13 years 4 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
Ed Blakey
ESA
2003
Springer
58views Algorithms» more  ESA 2003»
14 years 2 months ago
Kinetic Dictionaries: How to Shoot a Moving Target
A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point ...
Mark de Berg