17760 search results - page 185 / 3552 » A Generalization of the Massey-Ding Algorithm |
108
click to vote
SIGCSE
1999
ACM
15 years 8 months ago
1999
ACM
Algorithms have cometo be recognizedasthe cornerstone of computing. Surprisingly, there has been little research or discussion of general techniques for designing algorithms. Thou...
135
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
We consider a high-multiplicity generalization of the classical stable matching problem known as the stable allocation problem, introduced by Ba
134
click to vote
TCS
2008
15 years 4 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
141
click to vote
SWAT
1994
Springer
15 years 8 months ago
1994
Springer
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
146
click to vote
AAAI
2000
15 years 5 months ago
2000
We present a general algorithm for synthesizing state invariants that speed up automated planners and have other applications in reasoning about change. Invariants are facts that ...