68 search results - page 10 / 14 » Sequential optimisation without state space exploration |
ICMLA
2009
13 years 4 months ago
2009
Chord sequences are a compact and useful description of music, representing each beat or measure in terms of a likely distribution over individual notes without specifying the not...
ECCV
2002
Springer
14 years 8 months ago
2002
Springer
Sequential random sampling (`Markov Chain Monte-Carlo') is a popular strategy for many vision problems involving multimodal distributions over high-dimensional parameter spac...
CCS
2009
ACM
14 years 1 months ago
2009
ACM
Many programs operate reactively, patiently waiting for user input, subsequently running for a while producing output, and eventually returning to a state where they are ready to ...
IFM
2009
Springer
14 years 1 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
TACAS
2005
Springer
14 years 14 days ago
2005
Springer
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...