Sciweavers

1161 search results - page 163 / 233
» Kinetic Dependence Graphs
Sort
View
IJCAI
2007
14 years 12 months ago
A Machine Learning Approach for Statistical Software Testing
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...
Nicolas Baskiotis, Michèle Sebag, Marie-Cla...
GVD
2001
142views Database» more  GVD 2001»
14 years 11 months ago
An approach to the model-based fragmentation and relational storage of XML-documents
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...
Christian Süß
MCU
2004
129views Hardware» more  MCU 2004»
14 years 11 months ago
Solving 3CNF-SAT and HPP in Linear Time Using WWW
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...
Florin Manea, Carlos Martín-Vide, Victor Mi...
NIPS
2003
14 years 11 months ago
Bias-Corrected Bootstrap and Model Uncertainty
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...
Harald Steck, Tommi Jaakkola
AAAI
1998
14 years 11 months ago
Which Search Problems Are Random?
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...
Tad Hogg