359 search results - page 44 / 72 » The Parameterized Complexity of Counting Problems |
WDAG
1998
Springer
13 years 11 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...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— Network protocol system fingerprinting has been recognized as an important issue and a major threat to network security. Prevalent works rely largely on human experiences and i...