9842 search results - page 1876 / 1969 » The Complexity of the Matching-Cut Problem |
PLDI
2009
ACM
14 years 3 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
SC
2009
ACM
14 years 3 months ago
2009
ACM
The UNIC code is being developed as part of the DOE’s Nuclear Energy Advanced Modeling and Simulation (NEAMS) program. UNIC is an unstructured, deterministic neutron transport c...
EDBT
2009
ACM
14 years 3 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
FASE
2009
Springer
14 years 3 months ago
2009
Springer
Reuse of existing libraries simplifies software development efforts. However, these libraries are often complex and reusing the APIs in the libraries involves a steep learning cu...
ICDCN
2009
Springer
14 years 3 months ago
2009
Springer
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...