10608 search results - page 314 / 2122 » Complexity of O'Hara's Algorithm |
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...
90
Voted
ICCAD
1994
IEEE
15 years 4 months ago
1994
IEEE
For a logic design with level-sensitive latches, we need to validate timing signal paths which may flush through several latches. We developed efficient algorithms based on the mo...
FIMI
2003
15 years 2 months ago
2003
We describe an implementation of an algorithm for enumerating all maximal frequent sets using irredundant dualization, which is an improved version of that of Gunopulos et al. The...
99
Voted
DAM
2006
15 years 21 days ago
2006
This paper presents an optimal fully dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc ...
102
click to vote
JDA
2008
15 years 19 days ago
2008
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...