Sciweavers

837 search results - page 19 / 168
» Hard combinators
Sort
View
LPAR
2010
Springer
14 years 8 months ago
Partitioning SAT Instances for Distributed Solving
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...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
ENTCS
2008
132views more  ENTCS 2008»
14 years 10 months ago
Distributed Verification of Multi-threaded C++ Programs
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...
Stefan Edelkamp, Shahid Jabbar, Damian Sulewski
AAAI
2007
15 years 14 days ago
Complexity Boundaries for Horn Description Logics
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....
Markus Krötzsch, Sebastian Rudolph, Pascal Hi...
DEBU
2010
152views more  DEBU 2010»
14 years 7 months ago
Implementing an Append-Only Interface for Semiconductor Storage
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...
Colin W. Reid, Philip A. Bernstein
ECAI
2010
Springer
14 years 11 months ago
EP for Efficient Stochastic Control with Obstacles
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...
Thomas Mensink, Jakob J. Verbeek, Bert Kappen