1161 search results - page 163 / 233 » Kinetic Dependence Graphs |
151
click to vote
IJCAI
2007
15 years 6 months ago
2007
Some Statistical Software Testing approaches rely on sampling the feasible paths in the control flow graph of the program; the difficulty comes from the tiny ratio of feasible p...
142
click to vote
GVD
2001
15 years 6 months ago
2001
A flexible method to store XML documents in relational or object-relational databases is presented that is based on an adaptable fragmentation. Whereas most known approaches decom...
150
click to vote
MCU
2004
15 years 6 months ago
2004
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...
104
click to vote
NIPS
2003
15 years 6 months ago
2003
The bootstrap has become a popular method for exploring model (structure) uncertainty. Our experiments with artificial and realworld data demonstrate that the graphs learned from...
114
click to vote
AAAI
1998
15 years 6 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...