1425 search results - page 247 / 285 » Beyond Dependency Graphs |
APVIS
2006
13 years 9 months ago
2006
Centrality analysis determines the importance of vertices in a network based on their connectivity within the network structure. It is a widely used technique to analyse network-s...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
USS
2004
13 years 9 months ago
2004
Disassembly is the process of recovering a symbolic representation of a program's machine code instructions from its binary representation. Recently, a number of techniques h...
AAAI
1994
13 years 9 months ago
1994
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...