189 search results - page 10 / 38 » SCARAB: scaling reachability computation on large graphs |
172
click to vote
ECOOP
2009
Springer
15 years 10 months ago
2009
Springer
Pointer analyses derived from a Context-Free-Language (CFL) reachability formulation achieve very high precision, but they do not scale well to compute the points-to solution for a...
95
Voted
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Learning to cope with domain change has been known
as a challenging problem in many real-world applications.
This paper proposes a novel and efficient approach, named
domain ada...
109
click to vote
SDM
2004
SIAM
14 years 11 months ago
2004
SIAM
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
IJCAI
2003
14 years 11 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
100
click to vote
PE
2011
Springer
14 years 4 months ago
2011
Springer
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...