837 search results - page 19 / 168 » Hard combinators |
107
click to vote
LPAR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
138
Voted
ENTCS
2008
15 years 3 months ago
2008
Verification of multi-threaded C++ programs poses three major challenges: the large number of states, states with huge sizes, and time intensive expansions of states. This paper p...
99
Voted
AAAI
2007
15 years 6 months ago
2007
Horn description logics (Horn-DLs) have recently started to attract attention due to the fact that their (worst-case) data complexities are in general lower than their overall (i....
147
Voted
DEBU
2010
15 years 1 months ago
2010
Solid-state disks are currently based on NAND flash and expose a standard disk interface. To accommodate limitations of the medium, solid-state disk implementations avoid rewritin...
124
Voted
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...