281 search results - page 33 / 57 » The Complexity of Planar Counting Problems |
WDAG
1998
Springer
13 years 12 months ago
1998
Springer
The paper addresses the problemof solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader El...
TOG
2008
13 years 7 months ago
2008
Robust treatment of complex collisions is a challenging problem in cloth simulation. Some state of the art methods resolve collisions iteratively, invoking a fail-safe when a boun...
Publication
In this paper we address the problem of defining a measure of diversity for a population of individuals whose genome can be subjected to major reorganizations during the evolution...
WSC
2004
13 years 9 months ago
2004
Simulation methods are extensively used in modeling complex scheduling problems. However, traditional layout of simulation models can become complicated when they are used to find...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...