1963 search results - page 282 / 393 » The Maximum Solution Problem on Graphs |
87
Voted
ICCAD
2009
IEEE
14 years 10 months ago
2009
IEEE
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...
183
click to vote
SIGMOD
2008
ACM
16 years 24 days ago
2008
ACM
Data lineage and data provenance are key to the management of scientific data. Not knowing the exact provenance and processing pipeline used to produce a derived data set often re...
112
Voted
PRDC
2006
IEEE
15 years 6 months ago
2006
IEEE
Dependable systems are usually designed with multiple instances of components or logical processes, and often possess symmetries that may be exploited in model-based evaluation. T...
92
Voted
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
136
click to vote
COMCOM
2006
15 years 20 days ago
2006
Routing is the problem of sending a packet from a source node to a destination node in the network. Existing solutions for sensor networks assume a unit disk graph model, where me...