1092 search results - page 88 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
176
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper describes a polynomial time algorithm for min-area retiming for edge-triggered circuits to handle both setup and hold constraints. Given a circuit G and a target clock ...
178
click to vote
CAV
2001
Springer
15 years 9 months ago
2001
Springer
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
142
click to vote
ICC
2007
IEEE
16 years 9 days ago
2007
IEEE
— In this paper, the application of combinatorial geometry to noncoherent multiple–symbol differential detection (MSDD) is considered. The resulting algorithm is referred to as...
162
click to vote
CCGRID
2008
IEEE
16 years 14 days ago
2008
IEEE
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
162
click to vote
ICALP
2007
Springer
16 years 4 days ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...