681 search results - page 56 / 137 » General Polynomial Time Decomposition Algorithms |
109
click to vote
IPPS
2005
IEEE
15 years 6 months ago
2005
IEEE
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...
ALGORITHMICA
2010
15 years 19 days ago
2010
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
127
Voted
DAM
1999
15 years 4 days ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
118
click to vote
TSP
2011
14 years 7 months ago
2011
—This paper deals with the problem of estimating the steering direction of a signal, embedded in Gaussian disturbance, under a general quadratic inequality constraint, representi...
86
Voted
MOBIHOC
2008
ACM
16 years 2 days ago
2008
ACM
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...