264 search results - page 51 / 53 » On the possibility of faster SAT algorithms |
PEPM
2009
ACM
15 years 7 months ago
2009
ACM
Many applications need to respond to incremental modifications to data. Being incremental, such modification often require incremental modifications to the output, making it po...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
100
click to vote
SIAMSC
2010
14 years 4 months ago
2010
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
ECCV
2006
Springer
15 years 12 months ago
2006
Springer
i Integration of surface normal vectors is a vital component in many shape reconstruction algorithms that require integrating surface normals to produce their final outputs, the de...
RECOMB
2009
Springer
15 years 10 months ago
2009
Springer
Phylogenetic Bootstrapping (BS) is a standard technique for inferring confidence values on phylogenetic trees that is based on reconstructing many trees from minor variations of th...