14078 search results - page 361 / 2816 » Design and Analysis of Computer Algorithms |
191
click to vote
DAC
2003
ACM
16 years 12 hour ago
2003
ACM
Reduction of an extracted netlist is an important pre-processing step for techniques such as model order reduction in the design and analysis of VLSI circuits. This paper describe...
170
click to vote
SODA
1992
ACM
15 years 8 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
163
click to vote
ICDCS
1996
IEEE
15 years 11 months ago
1996
IEEE
This paper reports the design, implementation, and performance of a scalable and efficient tool to replicate Internet information services. Our tool targets replication degrees of...
215
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
175
click to vote
AAAI
1992
15 years 8 months ago
1992
Plans fail for many reasons. During planner development, failure can often be traced to actions of the planner itself. Failure recovery analysis is a procedure for analyzing execu...